#### Filter Results:

- Full text PDF available (52)

#### Publication Year

1992

2018

- This year (6)
- Last 5 years (35)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lance Fortnow, Rahul Santhanam
- Electronic Colloquium on Computational Complexity
- 2007

The OR-SAT problem asks, given Boolean formulae Î¦1,...,Î¦m each of size at most n, whether at least one of the Î¦i's is satisfiable. We show that there is no reduction from OR-SAT to any set A whereâ€¦ (More)

- Rahul Santhanam
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2010

We investigate the possibility of finding satisfying assignments to Boolean formulae and testing validity of quantified Boolean formulae (QBF) asymptotically faster than a brute force search. Ourâ€¦ (More)

- Rahul Santhanam
- Electronic Colloquium on Computational Complexity
- 2007

We show that for each k > 0, MA/1 (MA with 1 bit of advice) doesnâ€™t have circuits of size n. This implies the first superlinear circuit lower bounds for the promise versions of the classes MA, AM andâ€¦ (More)

- Lance Fortnow, Rahul Santhanam
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

We show a hierarchy for probabilistic time with one bit of advice, specifically we show that for all real numbers 1 /spl les/ /spl alpha/ /spl les/ /spl beta/, BPTIME(n/sup /spl alpha//)/l /spl sube/â€¦ (More)

- Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan
- Conference on Computational Complexity
- 2015

We show average-case lower bounds for explicit Boolean functions against bounded-depth threshold circuits with a superlinear number of wires. We show that for each integer d > 1, there is a constantâ€¦ (More)

- Lance Fortnow, Rahul Santhanam
- 2009 24th Annual IEEE Conference on Computationalâ€¦
- 2006

In 1982, Kannan showed that $\Sigma^\P_2$ does not have $n^k$-sized circuits for any $k$. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan's result, weâ€¦ (More)

- Lance Fortnow, Rahul Santhanam, Luca Trevisan
- STOC
- 2005

We show that for any constant a, ZPP/b(n) strictly contains ZPTIME(na)/b(n) for some b(n) = O(log n log log n). Our techniques are very general and give the same hierarchy for all common semanticâ€¦ (More)

- Ruiwen Chen, Rahul Santhanam
- Electronic Colloquium on Computational Complexity
- 2015

We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. For instances with n variables and cn clauses (constraints), we give algorithms running in time poly(n)Â·â€¦ (More)

- Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam
- Electronic Colloquium on Computational Complexity
- 2006

We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone errorcorrecting codes,â€¦ (More)

- Igor Carboni Oliveira, Rahul Santhanam
- Electronic Colloquium on Computational Complexity
- 2016

We study pseudodeterministic constructions, i.e., randomized algorithms which output the same solution on most computation paths. We establish unconditionally that there is an infinite sequenceâ€¦ (More)