The following pages link to Logics for complexity classes (Q4644504):
Displaying 19 items.
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- A recipe for the complexity analysis of non-classical logics (Q2782480) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- First-order reduction and computational complexity (Q2994065) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- On Complete Problems, Relativizations and Logics for Complexity Classes (Q3586004) (← links)
- Approximate formulae for a logic that capture classes of computational complexity (Q3613175) (← links)
- (Q3827989) (← links)
- Logical Description of Monotone NP Problems (Q4305345) (← links)
- Logics which capture complexity classes over the reals (Q5055931) (← links)
- STACS 2004 (Q5309712) (← links)
- Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy (Q5865564) (← links)
- Logical operations and Kolmogorov complexity (Q5958286) (← links)
- Logics capturing relativized complexity classes uniformly (Q6064295) (← links)
