Linear algebraic quantifiers
From MaRDI portal
Cites work
- A dichotomy theorem for nonuniform CSPs
- A proof of the CSP dichotomy conjecture
- Affine systems of equations and counting infinitary logic
- An optimal lower bound on the number of variables for graph identification
- Approximations of isomorphism and logics with linear-algebraic operators
- Capturing complexity classes with Lindström quantifiers
- Deux ou trois choses que je sais de Ln
- Generalizations of k-dimensional Weisfeiler-Leman stabilization
- Generalized Quantifiers and Logical Reducibilities
- Generalized quantifiers and pebble games on finite structures
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1253966 (Why is no real title available?)
- scientific article; zbMATH DE number 1302669 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 979011 (Why is no real title available?)
- Infinitary logics and 0-1 laws
- Limitations of the invertible-map equivalences
- Logical hierarchies in PTIME
- Logics capturing relativized complexity classes uniformly
- On Moschovakis closure ordinals
- Pebble games with algebraic rules
- Quantifiers closed under partial polymorphisms
- Rank logic is dead, long live rank logic!
- Relational queries computable in polynomial time
- Separating rank logic from polynomial time
- The expressive power of CSP-quantifiers
- Upper and lower bounds for first order expressibility
This page was built for publication: Linear algebraic quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236643)