Searching for authors named "Rahul Santhanam" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Lower bounds on the complexity of recognizing SAT by Turing machines
- …Lower bounds on the complexity of recognizing SAT by Turing machines Rahul Santhanam, Department…
- Cited by 5 (1 self) – Add To MetaCart
-
Circuit lower bounds for Merlin-Arthur classes
- …Circuit Lower Bounds for Merlin-Arthur Classes Rahul Santhanam Simon Fraser University rsanthan…
- Cited by 2 (0 self) – Add To MetaCart
-
Uniform hardness amplification in NP via monotone codes. ECCC
- … Rahul Santhanam School of Computing Science Simon Fraser University Vancouver, BC Canada {jburesho…
- Cited by 1 (1 self) – Add To MetaCart
-
Infeasibility of instance compression and succinct PCPs for NP
- …-1-60558-047-0/08/05 ...$5.00. Rahul Santhanam Department of Computer Science University of Toronto Toronto, Canada rsanthan…
- Cited by 8 (0 self) – Add To MetaCart
-
Promise hierarchies
- …Promise Hierarchies Lance Fortnow ∗ Rahul Santhanam ∗ Luca Trevisan † Abstract We show…
- Cited by 3 (0 self) – Add To MetaCart
-
Some results on average-case hardness within the polynomial hierarchy
- …Some Results on Average-Case Hardness within the Polynomial Hierarchy A. Pavan 1⋆ , Rahul…
- Cited by 3 (0 self) – Add To MetaCart
-
Graph model selection using maximum likelihood. ICML
- … Technological Institute at Chicago, Chicago, Illinois 60637 Rahul Santhanam rsanthan@(email omitted); School…
- Cited by 5 (1 self) – Add To MetaCart
Showing 1 through 7.
