Searching for authors named "Ramamohan Paturi" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
Complexity of k-SAT
- …Complexity of k-SAT Russell Impagliazzo , Ramamohan Paturi y University of California, San…
- Cited by 7 (0 self) – Add To MetaCart
-
The Light Bulb Problem
- …THE LIGHT BULB PROBLEM 1 Ramamohan Paturi 2 Sanguthevar Rajasekaran 3 John Reif 3 Univ…
- Add To MetaCart
-
Circuit Lower Bounds and Linear Codes
- …Circuit lower bounds and linear codes Ramamohan Paturi Pavel Pudlak y May 10, 2004 Abstract…
- Add To MetaCart
-
A Duality between Clause Width and Clause Density for SAT
- …, Ramamohan Paturi University of California, San Diego 9500 Gilman Drive, La Jolla, CA 92093 ccalabro,russell,paturi…
- Cited by 1 (0 self) – Add To MetaCart
-
Program Speedup in a Heterogeneous Computing Network
- … in a Heterogeneous Computing Network Val Donaldson Francine Berman Ramamohan Paturi Department…
- Cited by 12 (0 self) – Add To MetaCart
-
Scalable Network Architectures Using The Optical Transpose Interconnection System (OTIS)
- … Zane, Philippe Marchand, Ramamohan Paturi, and Sadik Esener University of California, San Diego…
- Cited by 29 (0 self) – Add To MetaCart
-
Size-Depth Trade-offs for Threshold Circuits (Extended Abstract)
- … , Ramamohan Paturi , Michael E. Saks y Abstract The following size--depth trade--off for threshold…
- Cited by 19 (0 self) – Add To MetaCart
-
Satisfiability Coding Lemma
- …Satisfiability Coding Lemma Ramamohan Paturi y , Pavel Pudlak , and Francis Zane y Abstract…
- Cited by 52 (5 self) – Add To MetaCart
-
Which Problems Have Strongly Exponential Complexity?
- …Which Problems Have Strongly Exponential Complexity? Russell Impagliazzo , Ramamohan Paturi…
- Cited by 46 (2 self) – Add To MetaCart
-
Exponential Lower Bounds for Depth 3 Boolean Circuits
- …Exponential Lower Bounds for Depth 3 Boolean Circuits Ramamohan Paturi , Michael E. Saks y…
- Cited by 12 (5 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
