scientific article; zbMATH DE number 8764

MaRDI QIDQ3971252zbMATH OpenFDO

Authors Kevin J. Compton

Publication date 25 June 1992

zbMATH Keywords

complexity of decision problemslower bounds of complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Classifying the computational complexity of problems
• The recognition complexity of decidable theories
• A uniform method for proving lower bounds on the computational complexity of logical theories
• On two problems of Turing complexity for strongly minimal theories
• scientific article; zbMATH DE number 3885864

Cited in

(2)

• A uniform method for proving lower bounds on the computational complexity of logical theories
• Existence of optimal ultrafilters and the fundamental complexity of simple theories

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