scientific article; zbMATH DE number 223337

MaRDI QIDQ5285981zbMATH OpenFDO

Authors Iain Stewart

Publication date 29 June 1993

zbMATH Keywords

descriptive complexity theorylogspace

Mathematics Subject Classification ID

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

Cited in

(12)

• Using the Hamiltonian path operator to capture NP
• Succinctness as a source of complexity in logical formalisms
• Context-sensitive transitive closure operators
• On the complexity of data disjunctions.
• Complexity of the \(r\)-query tautologies in the presence of a generic oracle
• Characterizing small depth and small space classes by operators of higher types
• scientific article; zbMATH DE number 1678393 (Why is no real title available?)
• scientific article; zbMATH DE number 515747 (Why is no real title available?)
• scientific article; zbMATH DE number 3992933 (Why is no real title available?)
• Capturing complexity classes with Lindström quantifiers
• scientific article; zbMATH DE number 223336 (Why is no real title available?)
• Kolmogorov characterizations of complexity classes

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