scientific article; zbMATH DE number 17544
From MaRDI portal
Publication:3974868
Recommendations
Cited in
(20)- Descriptive characterizations of computational complexity
- The quantifier structure of sentences that characterize nondeterministic time complexity
- Logical and schematic characterization of complexity classes
- Counting quantifiers, successor relations, and logarithmic space
- Descriptive complexity of \#P functions: a new perspective
- Descriptive complexity of deterministic polylogarithmic time
- Descriptional complexity and operations -- two non-classical cases
- Computational complexity and the expressive power of logics
- \(\mathrm{SO}^F\): a semantic restriction over second-order logic and its polynomial-time hierarchy
- Expressibility in _1¹
- Languages that Capture Complexity Classes
- scientific article; zbMATH DE number 4106276 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1263207 (Why is no real title available?)
- scientific article; zbMATH DE number 1342206 (Why is no real title available?)
- On the Computational Complexity of Small Descriptions
- scientific article; zbMATH DE number 1540059 (Why is no real title available?)
- scientific article; zbMATH DE number 1424025 (Why is no real title available?)
- On the complexity of small description and related topics
- Existential second-order logic over graphs: charting the tractability frontier
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)
