Bi-Immunity Separates Strong NP-Completeness Notions

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45841-7_33
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

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

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1996English

Query Order and NP-completeness

English

Trusses, NP-Completeness, and Genetic Algorithms

2006English

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2003English

On Generic Np-Completeness of the Boolean Satisfiability Problem

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2017English

NP-Completeness of Minimal Width Unordered Tree Layout

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Symmetry Conditions on the Coincidence of Some Notions of Quasi-Uniform Completeness

International Journal of Mathematics and Mathematical Sciences
Mathematics
2007English

Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1991English

Combining Derivations and Refutations for Cut-Free Completeness in Bi-Intuitionistic Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy