scientific article; zbMATH DE number 1048042

zbMATH Open0883.03023MaRDI QIDQ4348128FDOQ4348128

Authors: Lane A. Hemaspaandra, Leen Torenvliet, Sophie Fischer 

Publication date: 22 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• How easy is local search?
• A note on the complexity of local search problems
• The Complexity of Decision Versus Search
• On the hardness of global and local approximation

zbMATH Keywords

decision proceduresNP completenesspolynomial-time computable functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (1)

• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348128)