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):
Displaying 50 items.
- A note on the Kolmogorov data complexity and nonuniform logical definitions (Q290271) (← links)
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements (Q602723) (← links)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- On the power of combinatorial and spectral invariants (Q962126) (← 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)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← 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)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw (Q2045400) (← links)
- On WL-rank and WL-dimension of some Deza circulant graphs (Q2053703) (← links)
- Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization (Q2211259) (← links)
- Local WL invariance and hidden shades of regularity (Q2235273) (← links)
- Descriptive complexity of graph spectra (Q2273011) (← links)
- Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
- Strongly regular graphs with the \(7\)-vertex condition (Q2346763) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- New invariants for the graph isomorphism problem (Q2373963) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Baby-step giant-step algorithms for the symmetric group (Q2409009) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- Quantum and non-signalling graph isomorphisms (Q2421559) (← links)
- The graph isomorphism problem and approximate categories (Q2437326) (← 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)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Epsilon-logic is more expressive than first-order logic over finite structures (Q2710605) (← links)
- (Q2857447) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers (Q2947176) (← links)
