\(\text{NP}\not={co}\)-NP and models of arithmetic

DOI10.1016/0304-3975(94)00234-AzbMath0873.68067OpenAlexW1984362532MaRDI QIDQ672454

Claude Sureson

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00234-a

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

P, NP, Co-NP and weak systems of arithmetic

Cites Work

• An arithmetical characterization of NP
• NP-complete decision problems for binary quadratics
• Nondeterministic polynomial-time computations and models of arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\text{NP}\not={co}\)-NP and models of arithmetic