← back to search

Ramamohan Paturi

University of California San Diego · US
Area of research
Computational Theory and Mathematics · Artificial Intelligence
Research interest
Research interests include Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Machine Learning and Algorithms, and Constraint Satisfaction and Optimization.
h-index
30
citations
5,237
works
129
NIH funding
—
primary concept
—
email
✉ Find email ↗

Recent publications

On Problems as Hard as CNF-SAT
ACM Transactions on Algorithms 2016cited by 116position: middledoi
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility
2016cited by 104position: middledoi
On Problems as Hard as CNF-SAT
2012cited by 85position: middledoi

Grants

NetSe: Medium: Network Structure, Incentives, and Outcomes
NSF0905645$900,0002009–2013PIRePORTER
Exponential Complexity of NP-complete Problems
NSF0947262$200,0002009–2012PIRePORTER

Frequent collaborators

Magnus Wahlström · University of London2 papers (2012–2016)— · 2 papers (2012–2016)Marek Cygan · University of Birmingham2 papers (2012–2016)Daniel Lokshtanov · University of California, Santa Barbara2 papers (2012–2016)— · 2 papers (2012–2016)Jesper Nederlof · Utrecht University2 papers (2012–2016)— · 2 papers (2012–2016)Marco Carmosino · IBM (United States)1 papers (2016–2016)Russell Impagliazzo · University of California San Diego1 papers (2016–2016)Dániel Marx · Institute of Biophysics1 papers (2016–2016)Ivan Mihajlin · Steklov Mathematical Institute1 papers (2016–2016)— · 1 papers (2012–2012)Stefan Schneider · University of California, San Diego1 papers (2016–2016)Jiawei Gao · Zhongda Hospital Southeast University1 papers (2016–2016)