Original Title:
Non-collapsing assumptions about complexity classes needed for proving non-approximability results
Languages of Item:
English
Main subject category:
Logic
Other subject categories:
Computer science
Algorithms and Theory of Computation
Keywords:
complexity classes, approximation algorithms, randomized algorithms, nondeterminism, computational complexity
Notes:
Περιλαμβάνει περίληψη και βιβλιογραφικές αναφορές
