scientific article; zbMATH DE number 17544
From MaRDI portal
Publication:3974868
zbMATH Open0756.68041MaRDI QIDQ3974868FDOQ3974868
Authors: Neil Immerman 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
Cited In (18)
- Languages that Capture Complexity Classes
- The quantifier structure of sentences that characterize nondeterministic time complexity
- Expressibility in \(\Sigma_1^1\)
- Descriptive complexity of \#P functions: a new perspective
- Title not available (Why is that?)
- Descriptional complexity and operations -- two non-classical cases
- Counting quantifiers, successor relations, and logarithmic space
- Descriptive characterizations of computational complexity
- Logical and schematic characterization of complexity classes
- On the Computational Complexity of Small Descriptions
- Existential second-order logic over graphs: charting the tractability frontier
- On the complexity of small description and related topics
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\mathrm{SO}^F\): a semantic restriction over second-order logic and its polynomial-time hierarchy
- Descriptive complexity of deterministic polylogarithmic time
- Computational complexity and the expressive power of logics
- 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 Q3974868)
