Cook Versus Karp-Levin: Separating Completeness Notions if NP Is Not Small

Theoretical Computer Science - Netherlands
doi 10.1016/0304-3975(95)00189-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Bi-Immunity Separates Strong NP-Completeness Notions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

A Zero-One Law for RP and Derandomization of AM if NP Is Not Small

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2009English

Relative to a Random Oracle, NP Is Not Small

English

Query Order and NP-completeness

English

“If Happiness Is Not the Aim of Politics, Then What Is?”: Rorty Versus Foucault

Foucault Studies
Philosophy
2011English

Trusses, NP-Completeness, and Genetic Algorithms

2006English

Separating the Notions of Self- And Autoreducibility

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Short Proof That Np Is Not P

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2014English

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy