Rahul Santhanam : Publications
-
[1]
Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability
Rahul Santhanam
2010.
Details about Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability | BibTeX data for Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability
-
[2]
Infeasibility of Instance Compression and Succinct PCPs for NP
Rahul Santhanam and Lance Fortnow
2008.
Details about Infeasibility of Instance Compression and Succinct PCPs for NP | BibTeX data for Infeasibility of Instance Compression and Succinct PCPs for NP
-
[3]
Circuit Lower Bounds for Merlin−Arthur Classes
Rahul Santhanam
2007.
Details about Circuit Lower Bounds for Merlin−Arthur Classes | BibTeX data for Circuit Lower Bounds for Merlin−Arthur Classes
-
[4]
Hierarchy Theorems for Probabilistic Polynomial Time
Rahul Santhanam and Lance Fortnow
2004.
Details about Hierarchy Theorems for Probabilistic Polynomial Time | BibTeX data for Hierarchy Theorems for Probabilistic Polynomial Time