dc:subject
|
NP-completeness, approximation algorithms, complexity hierarchies, computations on polynomials and finite fields, error-correcting codes, hardness of approximations, interactive computation, probabilistic computation, proof checking, reducibility and completeness, trade-offs/relations among complexity measures
(xsd:string)
|