Publication:3937379

zbMath0481.03025MaRDI QIDQ3937379

No author found.

Publication date: 1981

zbMATH Keywords

independence results; P=NP problem; formal systems weaker than Peano arithmetic

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations

68Q65: Abstract data types; algebraic specification

03D15: Complexity of computation (including implicit computational complexity)

68-02: Research exposition (monographs, survey articles) pertaining to computer science

Related Items

A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets, An appraisal of computational complexity for operations researchers