| Document Date: 2009-11-12 23:47:30
Open Document File Size: 207,78 KBShare Result on Facebook
Company IBM / CNF / AT&T / / Currency pence / / / Event Analyst Recommendation / FDA Phase / / Facility IBM Almaden Research Center / Carnegie Mellon University / NJ Ryan Williams† IBM Almaden Research Center / / IndustryTerm sub-quadratic time algorithm / brute-force search / linear time algorithm / computable protocols / satisfiability algorithms / set algorithm / sublinear communication protocol / computable nondeterministic protocols / deterministic algorithm / m-bit communication protocol / natural reachability algorithm / brute-force algorithm / trivial algorithm / search problems / / Organization National Science Foundation / NJ Ryan Williams† IBM Almaden Research Center San Jose / Carnegie Mellon University / / / Position author / representative / / Product Bang & Olufsen Form 2 Headphone/Headset / Sonim XP1 Cellular Phone / Grolmusz / / Technology m-bit communication protocol / satisfiability algorithms / sublinear communication protocol / brute-force algorithm / known algorithms / time algorithm / trivial algorithm / implied k-SAT algorithm / deterministic algorithm / dominating set algorithm / linear time algorithm / improved algorithm / natural reachability algorithm / faster SAT algorithms / k-SAT algorithm / Surprising algorithms / good k-Dominating Set algorithm / reasonably computable nondeterministic protocols / sub-quadratic time algorithm / /
SocialTag |
On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams†