Pages that link to "Item:Q1977423"
From MaRDI portal
The following pages link to Equivalence in finite-variable logics is complete for polynomial time (Q1977423):
Displaying 9 items.
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements (Q602723) (← links)
- On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Proof equivalence in MLL is PSPACE-complete (Q2790165) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
- Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)