Pages that link to "Item:Q3974868"
From MaRDI portal
The following pages link to Descriptive and computational complexity (Q3974868):
Displaying 16 items.
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- Descriptive complexity of deterministic polylogarithmic time (Q2303589) (← links)
- Descriptional complexity and operations -- two non-classical cases (Q2400987) (← links)
- SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy (Q3224003) (← links)
- Languages that Capture Complexity Classes (Q3773337) (← links)
- Descriptive and computational complexity (Q3830533) (← links)
- Descriptive complexity (Q4227581) (← links)
- (Q4234078) (← links)
- On the Computational Complexity of Small Descriptions (Q4277541) (← links)
- (Q4945215) (← links)
- On the complexity of small description and related topics (Q5096821) (← links)
- Existential second-order logic over graphs (Q5501192) (← links)