Concepedia

Ramamohan Paturi

RP

46

Publications

4.9K

Citations

29

H-Index

1986

Active since

Affiliations

University of California San Diego(Current)

Rutgers, The State University of New Jersey

University of Chicago

University of Southern California

Ramamohan Paturi is an author at University of California San Diego specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityDiscrete MathematicsCombinatorial OptimizationSatisfiabilityCircuit ComplexityComputer EngineeringAutomated ReasoningTheory Of Computing

Publications per year

1986–2017

46

Publications

46

Which Problems Have Strongly Exponential Complexity?

Russell Impagliazzo, Ramamohan Paturi, Francis Zane · Journal of Computer and System Sciences · 2001 · 1.3K citations

Strongly Exponential Complexity, Computational Complexity, Time Complexity +2

On the Complexity of k-SAT

Russell Impagliazzo, Ramamohan Paturi · Journal of Computer and System Sciences · 2001 · 996 citations

Engineering, Sat Solving, Computational Complexity +6

An improved exponential-time algorithm for <i>k</i> -SAT

Ramamohan Paturi, Pavel Pudlák, Michael Saks et al. · Journal of the ACM · 2005 · 212 citations

Theory Of Computing, Circuit Complexity, Computational Complexity Theory +15

Complexity of k-SAT

Russell Impagliazzo, Ramamohan Paturi · 2003 · 164 citations

Mathematical Programming, Exponential-time Hypothesis, Computational Complexity Theory +14

On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)

Ramamohan Paturi · 1992 · 159 citations · Full text

Circuit Complexity, Theory Of Computing, Symmetric Function +11

Rows per page

1–5 of 46