Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
From MaRDI portal
Publication:4827608
DOI10.1112/S1461157000000371zbMath1087.68567MaRDI QIDQ4827608
Publication date: 18 November 2004
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.lms.ac.uk/jcm/6/lms2002-004/
Related Items
Cites Work
- Logical and schematic characterization of complexity classes
- Reachability and the power of local ordering
- Program schemes, arrays, Lindström quantifiers and zero-one laws
- Logical Description of Monotone NP Problems
- Hierarchies in classes of program schemes
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Finite Model Theory