<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-04-01 09:13:02Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics |
Add to Reading List |
Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ | A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†DocID: 18Jpc - View Document |
| Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, butDocID: 17zOY - View Document |
| Pattern matching with mismatches (Hamming distance) Advanced Algorithms – COMS31900Input A text string T (length n) and a pattern string P (length m) 0DocID: 14F6y - View Document |
| Improved Soundness for QMA with Multiple ProversDocID: 13Qoj - View Document |
| Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗DocID: 13wLq - View Document |