scientific article; zbMATH DE number 223336

MaRDI QIDQ5285980zbMATH OpenFDO

Authors Iain Stewart

Publication date 29 June 1993

zbMATH Keywords

descriptive complexity theorylogspace

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Cited in

(18)

• scientific article; zbMATH DE number 515747 (Why is no real title available?)
• scientific article; zbMATH DE number 1223623 (Why is no real title available?)
• scientific article; zbMATH DE number 1086669 (Why is no real title available?)
• Succinctness as a source of complexity in logical formalisms
• Context-sensitive transitive closure operators
• Bounded Query Classes
• Characterizing small depth and small space classes by operators of higher types
• Capturing complexity classes with Lindström quantifiers
• On bounded query machines
• Kolmogorov characterizations of complexity classes
• On the complexity of data disjunctions.
• scientific article; zbMATH DE number 1555186 (Why is no real title available?)
• The complexity class θp2: Recent results and applications in AI and modal logic
• scientific article; zbMATH DE number 18631 (Why is no real title available?)
• Some connections between bounded query classes and non-uniform complexity.
• A finite model-theoretical proof of a property of bounded query classes within PH
• scientific article; zbMATH DE number 1678393 (Why is no real title available?)
• Characterizations of some complexity classes between \(\Theta_2^{\mathrm{P}}\) and \(\Delta_2^{\mathrm{P}}\)

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