scientific article; zbMATH DE number 515747

MaRDI QIDQ4283250zbMATH OpenFDO

Authors Iain Stewart

Publication date 13 June 1994

zbMATH Keywords

descriptive complexity theorylogspaceoracle Turing machinehierarchy of logicsbounded-query complexity classescomplexity class \(L^{NP}\)

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 223337
• Bounded queries to SAT and the Boolean hierarchy
• scientific article; zbMATH DE number 1678393
• scientific article; zbMATH DE number 223336
• Bounding queries in the analytic polynomial-time hierarchy

Cited in

(5)

• Bounded Query Classes
• Complexity of the \(r\)-query tautologies in the presence of a generic oracle
• scientific article; zbMATH DE number 1555186 (Why is no real title available?)
• scientific article; zbMATH DE number 3992933 (Why is no real title available?)
• scientific article; zbMATH DE number 1678393 (Why is no real title available?)

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