Pages that link to "Item:Q5204302"
From MaRDI portal
The following pages link to Circuit complexity and the expressive power of generalized first-order formulas (Q5204302):
Displaying 6 items.
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290) (← links)
- Definability by constant-depth polynomial-size circuits (Q3767263) (← links)
- (Q4362929) (← links)
- OUP accepted manuscript (Q5894702) (← links)