Amanote Research
Register
Sign In
The Relative Complexity of NP Search Problems
doi 10.1145/225058.225147
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1995
Authors
Paul Beame
Stephen Cook
Jeff Edmonds
Russell Impagliazzo
Toniann Pitassi
Publisher
ACM Press
Related search
Inductive Complexity of the P Versus Np Problem
Parallel Processing Letters
Hardware
Theoretical Computer Science
Architecture
Software
Reoptimization of NP-Hard Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
P, NP and Mathematics – A Computational Complexity Perspective
On the Complexity of Local Search
The Complexity of Design Automation Problems
Relative to a Random Oracle, NP Is Not Small
On the Classification of NP Complete Problems and Their Duality Feature
International Journal of Computer Science and Information Technology
On the Space Complexity of Parameterized Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Complexity of Induced Tree Reconfiguration Problems
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
