scientific article; zbMATH DE number 3708375

MaRDI QIDQ3900044zbMATH OpenFDO

Authors Vladimir Yu. Sazonov

Publication date 1980

zbMATH Keywords

exponential lower time complexityNP sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Cited in

(7)

• Bounded arithmetic, proof complexity and two papers of Parikh
• Hereditarily-finite sets, data bases and polynomial-time computability
• -languages for sets and LOGSPACE computable graph transformers
• On the metamathematics of the P vs. NP question
• Asymptotic invariants, complexity of groups and related problems.
• On feasible numbers
• ``NP\(=\)P? and restricted partitions

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 Q3900044)