Pages that link to "Item:Q1204528"
From MaRDI portal
The following pages link to An optimal lower bound on the number of variables for graph identification (Q1204528):
Displayed 33 items.
- Inherent complexity of recursive queries (Q696953) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- Permutation group approach to association schemes (Q1039422) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- On a new high dimensional Weisfeiler-Lehman algorithm (Q1296386) (← links)
- On the geometric graph isomorphism problem (Q1358911) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- Reachability and the power of local ordering (Q1367543) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- A query language for NC (Q1376409) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Directions in generalized quantifier theory (Q1908858) (← links)
- Pruning the search tree in the constructive enumeration of molecular graphs (Q1917340) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- Epsilon-logic is more expressive than first-order logic over finite structures (Q2710605) (← links)
- Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- Fixed-Point Definability and Polynomial Time (Q3644737) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
- On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
- On fixed-point logic with counting (Q4508261) (← links)
- On polynomial time computation over unordered structures (Q4779654) (← links)
- The expressive power of fixed-point logic with counting (Q4879905) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- The hierarchy theorem for generalized quantifiers (Q5687317) (← links)
- Descriptive complexity of finite structures: Saving the quantifier rank (Q5718668) (← links)