The following pages link to Logical hierarchies in PTIME (Q1817218):
Displaying 50 items.
- On the expressive power of counting (Q672336) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- Local properties of query languages (Q1575140) (← links)
- LOGSPACE and PTIME characterized by programming languages (Q1575880) (← links)
- Pebble games and cospectral graphs (Q1689933) (← links)
- Logspace and logtime leaf languages (Q1817219) (← links)
- Logics that define their own semantics (Q1818429) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Linear time and the power of one first-order universal quantifier (Q1854556) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- The expressive power of finitely many generalized quantifiers (Q1908344) (← links)
- Directions in generalized quantifier theory (Q1908858) (← links)
- A double arity hierarchy theorem for transitive closure logic (Q1913297) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Arity hierarchies (Q2563982) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Epsilon-logic is more expressive than first-order logic over finite structures (Q2710605) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- Relational queries computable in polynomial time (Q3753525) (← links)
- (Q4218934) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
- On fixed-point logic with counting (Q4508261) (← links)
- RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! (Q4628673) (← links)
- Generalized Quantifiers and Logical Reducibilities (Q4763536) (← links)
- Notions of locality and their logical characterizations over finite models (Q4948541) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- Relating Structure and Power: Comonadic Semantics for Computational Resources (Q5079721) (← links)
- Definable Inapproximability: New Challenges for Duplicator (Q5079727) (← links)
- (Q5079744) (← links)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs (Q5092407) (← links)
- Capturing complexity classes with Lindström quantifiers (Q5096870) (← links)
- Database Theory - ICDT 2005 (Q5316600) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- Constructing Hard Examples for Graph Isomorphism (Q5377355) (← links)
- Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- Inapproximability of unique games in fixed-point logic with counting (Q6563050) (← links)
- The pebble-relation comonad in finite model theory (Q6563056) (← links)
- Game comonads \& generalised quantifiers (Q6597958) (← links)
