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