January 01, 2011 article Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant SIAM Journal on Computing DOI: 10.1137/090756144 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 80 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 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 1 result References 0