Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Kambhampati, Soumya C."'
Autor:
Kambhampati, Soumya C., Liu, Thomas
Publikováno v:
Published as student abstract in Proceedings of AAAI 2013 (National Conference on Artificial Intelligence)
A fundamental question in Computer Science is understanding when a specific class of problems go from being computationally easy to hard. Because of its generality and applications, the problem of Boolean Satisfiability (aka SAT) is often used as a v
Externí odkaz:
http://arxiv.org/abs/1304.0145
