Choiceless Computation and Symmetry
From MaRDI portal
Publication:3586021
DOI10.1007/978-3-642-15025-8_28zbMath1287.68066OpenAlexW1600567704MaRDI QIDQ3586021
Publication date: 3 September 2010
Published in: Fields of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_28
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
Related Items
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes ⋮ Unnamed Item ⋮ Is Polynomial Time Choiceless? ⋮ Choiceless Logarithmic Space
Cites Work
- Unnamed Item
- Unnamed Item
- Choiceless polynomial time
- An optimal lower bound on the number of variables for graph identification
- Structure and complexity of relational queries
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
- Relational queries computable in polynomial time
- Strong extension axioms and Shelah's zero-one law for choiceless polynomial time
- On polynomial time computation over unordered structures