Publication:3589189
From MaRDI portal
zbMath1194.68001MaRDI QIDQ3589189
Publication date: 20 September 2010
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Inductive Complexity of P versus NP Problem, Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus, Computational complexity in the design of voting rules, Regularity properties for sparse regression, A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions, \(\mathcal P = \mathcal{NP}\)?, Quantum one-way permutation over the finite field of two elements, On relationships between complexity classes of Turing machines, NP-completeness in hedonic games, Progress in quantum algorithms, Hardness assumptions in the foundations of theoretical computer science, Phase retrieval from very few measurements