Pages that link to "Item:Q1323362"
From MaRDI portal
The following pages link to Logical and schematic characterization of complexity classes (Q1323362):
Displaying 17 items.
- Complexity classes as mathematical axioms. II (Q259630) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays (Q3611731) (← links)
- Logics for complexity classes (Q4644504) (← links)
- Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures (Q4827608) (← links)
- Hierarchies in classes of program schemes (Q4943505) (← links)
- Logics which capture complexity classes over the reals (Q5055931) (← links)
- Computer Science Logic (Q5311269) (← links)
- Dimension Characterizations of Complexity Classes (Q5756668) (← links)