scientific article; zbMATH DE number 5044336

MaRDI QIDQ5480947zbMATH OpenFDO

Authors Zhu Zhao, Zhongqi Dong

Publication date 7 August 2006

zbMATH Keywords

dependable computationNP-hardness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1501630
• scientific article; zbMATH DE number 7250153
• Hardness hypotheses, derandomization, and circuit complexity
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Hardness-randomness tradeoffs for bounded depth arithmetic circuits
• scientific article; zbMATH DE number 7150624
• Multitasking capacity: hardness results and improved constructions
• scientific article; zbMATH DE number 3902028
• Hardness assumptions in the foundations of theoretical computer science
• scientific article; zbMATH DE number 4201582

Cited in

(2)

• Tractability, hardness, and kernelization lower bound for and/or graph solution
• scientific article; zbMATH DE number 1501630 (Why is no real title available?)

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 Q5480947)