Ramamohan Paturi - Concepedia

Author

Ramamohan Paturi

University of California San Diego

Also Known As

Mucha, Marcin, Paturi, Ramamohan, R. Paturi, Ramamohan Paturi

123

Publications

5.2K

Citations

H-Index

Concepts

All Affiliations

University of California San Diego Rutgers, The State University of New Jersey University of Chicago University of Southern California

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	25	34	3.1K
2	Business	2	2	75
3	Social Sciences	2	2	46
4	Cognitive Science	2	2	46
5	Behavioral Sciences	1	1	21

Ramamohan Paturi

Publications

4.9K

Citations

H-Index

Page 1

	Year	Citations
Which Problems Have Strongly Exponential Complexity? Russell Impagliazzo, Ramamohan Paturi, Francis Zane Journal of Computer and System Sciences Strongly Exponential ComplexityComputational ComplexityTime ComplexityComputational ProblemExponential Algorithm	2001	1.3K
On the Complexity of k-SAT Russell Impagliazzo, Ramamohan Paturi Journal of Computer and System Sciences EngineeringSat SolvingComputational ComplexityTime ComplexityComputer Science	2001	996
An improved exponential-time algorithm for <i>k</i> -SAT Ramamohan Paturi, Pavel Pudlák, Michael Saks, Journal of the ACM Theory Of ComputingCircuit ComplexityComputational Complexity TheoryBoolean FormulasEngineering	2005	212
Complexity of k-SAT Russell Impagliazzo, Ramamohan Paturi Mathematical ProgrammingExponential-time HypothesisComputational Complexity TheoryEngineeringApproximation Theory	2003	164
On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) Ramamohan Paturi Circuit ComplexityTheory Of ComputingSymmetric FunctionSymmetric Boolean FunctionsEngineering	1992	159
An improved exponential-time algorithm for k-SAT Ramamohan Paturi, P. Pudlik, Michael Saks, Mathematical ProgrammingEngineeringComputational ComplexityFormal VerificationConstraint Solving	2002	158
Which problems have strongly exponential complexity? Russell Impagliazzo, Ramamohan Paturi, Francis Zane Circuit ComplexityMathematical ProgrammingComputational Complexity TheoryEngineeringLower Bound	2002	150
Probabilistic communication complexity Ramamohan Paturi, Janoš Šimon Journal of Computer and System Sciences EngineeringProbabilistic Communication ComplexityCommunication ComplexityComputational ComplexityProbabilistic Computation	1986	124
On Problems as Hard as CNF-SAT Marek Cygan, Holger Dell, Daniel Lokshtanov, ACM Transactions on Algorithms Theory Of ComputingComputational Complexity TheoryEngineeringGrowth Rate 2Automated Reasoning	2016	114
A Duality between Clause Width and Clause Density for SAT Chris Calabro, Russell Impagliazzo, Ramamohan Paturi SyntaxEngineeringComputational Complexity TheoryConstant DensityN Variables	2006	106

Page 1