The Fault Tolerance of NP-Hard Problems
From MaRDI portal
Publication:3618596
DOI10.1007/978-3-642-00982-2_32zbMATH Open1234.68135OpenAlexW1513273197MaRDI QIDQ3618596FDOQ3618596
Christian Glaßer, Aduri Pavan, Stephen Travers
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_32
Recommendations
- The fault tolerance of NP-hard problems
- Fault-tolerance and complexity (extended abstract)
- scientific article; zbMATH DE number 913541
- scientific article; zbMATH DE number 1775419
- An Approximation Formula for a Class of Fault-Tolerant Computers
- Algorithmic Fault Tolerance Using the Lanczos Method
- scientific article
- The Complexity of Fault Detection Problems for Combinational Logic Circuits
- Fault-tolerant Computation in the Full Information Model
- Troubleshooting: NP-hardness and solution methods
Cites Work
- Self-testing/correcting with applications to numerical problems
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
- A comparison of polynomial time reducibilities
- Complete sets and closeness to complexity classes
- On sparse hard sets for counting classes
- A Note on Sparse Complete Sets
- On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
- On lower bounds of the closeness between complexity classes
- Redundancy in Complete Sets
This page was built for publication: The Fault Tolerance of NP-Hard Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618596)
