![Complexity classes / Circuit complexity / Boolean algebra / NP-complete problems / Time complexity / ACC0 / Cook–Levin theorem / P / NC / Theoretical computer science / Computational complexity theory / Applied mathematics Complexity classes / Circuit complexity / Boolean algebra / NP-complete problems / Time complexity / ACC0 / Cook–Levin theorem / P / NC / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/cd99c4714f9ae632c137e1d9fbfe248b.jpg)
| Document Date: 2014-04-01 09:13:02 Open Document File Size: 260,84 KBShare Result on Facebook
Company 3SAT / / / IndustryTerm satisfiability algorithm / widespread applications / odd-even mergesort networks / equivalent network / odd-even mergesort network / nontrivial satisfiability algorithms / circuit computing clauses / computing / number-on-forehead protocols / inefficient pre-processing / brute-force search / low-space algorithm / quasilinear-time algorithm / log-space machine computing connections / satisfiability algorithms / / Organization National Science Foundation / / Person Hamid Jahanjou∗ Eric Miles / Van Melkebeek / Kowalski Melkebeek / / Position head / / ProvinceOrState M. / / Technology nontrivial satisfiability algorithms / RAM / satisfiability algorithm / satisfiability algorithms / random access / simulation / quasilinear-time algorithm / low-space algorithm / number-on-forehead protocols / /
SocialTag |