September 01, 2002 article On polynomial time computation over unordered structures Journal of Symbolic Logic DOI: 10.2178/jsl/1190150152 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 64 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Choiceless Polynomial Time with Witnessed Symmetric Choice 2024 Journal of the ACM article Mathematics Advanced Topology and Set Theory 0 citations Temporal Constraint Satisfaction Problems in Fixed-Point Logic 2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access 10 citations 2 results References 0