The Power of Choice for Random Satisfiability

DOI10.1007/978-3-642-40328-6_34zbMath1405.68323arXiv1211.6997OpenAlexW1550219205MaRDI QIDQ2851879

Thomas P. Hayes, Moore, Cristopher, Varsha Dani, Josep Diaz

Publication date: 4 October 2013

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.6997

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Waiter-client and client-waiter colourability and \(k\)-SAT games

This page was built for publication: The Power of Choice for Random Satisfiability