The Fault Tolerance of NP-Hard Problems
type: Item
instance of: scholarly article
title: The Fault Tolerance of NP-Hard Problems
zbMATH Open document ID: 1234.68135
DOI: 10.1007/978-3-642-00982-2_32
author: Christian Glaßer
author: Aduri Pavan
author: Stephen Travers
published in: Language and Automata Theory and Applications
publication date: 2009-04-02T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5538860
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-00982-2 32
OpenAlex ID: W1513273197
cites work: Self-testing/correcting with applications to numerical problems
cites work: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
cites work: On lower bounds of the closeness between complexity classes
cites work: A comparison of polynomial time reducibilities
cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets
cites work: Redundancy in Complete Sets
cites work: A Note on Sparse Complete Sets
cites work: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
cites work: On sparse hard sets for counting classes
cites work: Complete sets and closeness to complexity classes
Recommended article: The fault tolerance of NP-hard problems
Recommended article: Fault-tolerance and complexity (Extended abstract)
Recommended article: Q4887812
Recommended article: Q4542552
Recommended article: An Approximation Formula for a Class of Fault-Tolerant Computers
Recommended article: Algorithmic Fault Tolerance Using the Lanczos Method
Recommended article: Q3624006
Recommended article: The Complexity of Fault Detection Problems for Combinational Logic Circuits
Recommended article: Fault-tolerant Computation in the Full Information Model
Recommended article: Troubleshooting: NP-hardness and solution methods
description: scientific article