Capturing complexity classes with Lindström quantifiers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3814972 (Why is no real title available?)
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1555186 (Why is no real title available?)
- scientific article; zbMATH DE number 223336 (Why is no real title available?)
- scientific article; zbMATH DE number 223337 (Why is no real title available?)
- Classifying the computational complexity of problems
- Comparing the Expressibility of Languages Formed Using NP-Complete Operators
- Definability hierarchies of generalized quantifiers
- Expressibility and Parallel Complexity
- Languages that Capture Complexity Classes
- Logical hierarchies in PTIME
- Relativized alternation and space-bounded computation
Cited in
(5)
This page was built for publication: Capturing complexity classes with Lindström quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096870)