Pages that link to "Item:Q4358054"
From MaRDI portal
The following pages link to Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054):
Displaying 13 items.
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Relativization of quantifiers in finite models (Q2702252) (← links)
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 (Q4432544) (← links)
- (Q4785505) (← links)
- (Q4895482) (← links)
- (Q5092325) (← links)
- A finite model-theoretical proof of a property of bounded query classes within PH (Q5311769) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- Logics capturing relativized complexity classes uniformly (Q6064295) (← links)