NP=co-NP and models of arithmetic
From MaRDI portal
Publication:672454
Recommendations
- Nondeterministic polynomial-time computations and models of arithmetic
- P, NP, Co-NP and weak systems of arithmetic
- scientific article; zbMATH DE number 2236639
- On LP-models of arithmetic
- On cofinal extensions of models of arithmetic
- Computable quotient presentations of models of arithmetic and set theory
- On the Structure of $\cal NP_\Bbb C$
- The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\)
- A model-theoretic proof for P ≠ NP over all infinite abelian group
- On Models Constructed by Means of the Arithmetized Completeness Theorem
Cites work
- An arithmetical characterization of NP
- scientific article; zbMATH DE number 3814977 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- Nondeterministic polynomial-time computations and models of arithmetic
- NP-complete decision problems for binary quadratics
Cited in
(5)- scientific article; zbMATH DE number 999649 (Why is no real title available?)
- P ≠ NP ∩ co-NP for Infinite Time Turing Machines
- scientific article; zbMATH DE number 27190 (Why is no real title available?)
- A model-theoretic proof for P ≠ NP over all infinite abelian group
- P, NP, Co-NP and weak systems of arithmetic
This page was built for publication: \(\text{NP}\not={co}\)-NP and models of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672454)
