scientific article; zbMATH DE number 5787962
From MaRDI portal
Publication:3589189
zbMATH Open1194.68001MaRDI QIDQ3589189FDOQ3589189
Authors: Stephen Cook 
Publication date: 20 September 2010
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3978381
- scientific article; zbMATH DE number 7676615
- P, NP, and the Post correspondence problem
- P versus NP: the star problem of the mathematics of computation
- scientific article; zbMATH DE number 62443
- scientific article; zbMATH DE number 1072533
- scientific article; zbMATH DE number 1775419
- To the problem P=?NP
- scientific article; zbMATH DE number 7683979
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (17)
- Computational complexity in the design of voting rules
- \(\mathcal P = \mathcal{NP}\)?
- Title not available (Why is that?)
- Phase retrieval from very few measurements
- Regularity properties for sparse regression
- Inductive complexity of P versus NP problem (extended abstract)
- Title not available (Why is that?)
- A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions
- Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus
- Hardness assumptions in the foundations of theoretical computer science
- Quantum one-way permutation over the finite field of two elements
- On relationships between complexity classes of Turing machines
- Title not available (Why is that?)
- Progress in quantum algorithms
- NP-completeness in hedonic games
- Algorithmic mechanism design with investment
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589189)
