scientific article; zbMATH DE number 515747

zbMATH Open0789.68059MaRDI QIDQ4283250FDOQ4283250

Authors: Iain Stewart 

Publication date: 13 June 1994

Title of this publication is not available (Why is that?)

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

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)

Cited In (5)

• Bounded Query Classes
• Complexity of the \(r\)-query tautologies in the presence of a generic oracle
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)