scientific article; zbMATH DE number 223336
From MaRDI portal
Publication:5285980
zbMATH Open0782.68049MaRDI QIDQ5285980FDOQ5285980
Authors: Iain Stewart 
Publication date: 29 June 1993
Title of this publication is not available (Why is that?)
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (17)
- Bounded Query Classes
- On the complexity of data disjunctions.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A finite model-theoretical proof of a property of bounded query classes within PH
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizations of some complexity classes between \(\Theta_2^{\mathrm{P}}\) and \(\Delta_2^{\mathrm{P}}\)
- Some connections between bounded query classes and non-uniform complexity.
- Capturing complexity classes with Lindström quantifiers
- Succinctness as a source of complexity in logical formalisms
- Context-sensitive transitive closure operators
- Title not available (Why is that?)
- The complexity class θp2: Recent results and applications in AI and modal logic
- Title not available (Why is that?)
- Characterizing small depth and small space classes by operators of higher types
- On bounded query machines
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)
