Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures (Q4827608): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Finite Model Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hierarchies in classes of program schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Program schemes, arrays, Lindström quantifiers and zero-one laws / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reachability and the power of local ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logical and schematic characterization of complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logical Description of Monotone NP Problems / rank | |||
Normal rank |
Revision as of 15:25, 7 June 2024
scientific article; zbMATH DE number 2116747
Language | Label | Description | Also known as |
---|---|---|---|
English | Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures |
scientific article; zbMATH DE number 2116747 |
Statements
Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures (English)
0 references
18 November 2004
0 references
polynomial-time solvable problems
0 references