The Fault Tolerance of NP-Hard Problems
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
The fault tolerance of NP-hard problems
Information and Computation
Hi-index | 5.23 |