Ramamohan Paturi

From MaRDI portal
Person:192223

Available identifiers

zbMath Open paturi.ramamohanWikidataQ102109717 ScholiaQ102109717MaRDI QIDQ192223

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q51113512020-05-27Paper
Subquadratic algorithms for succinct stable matching2019-05-21Paper
A satisfiability algorithm for \(\mathrm{AC}^0\)2019-05-10Paper
On problems as hard as CNF-SAT2018-11-05Paper
Beating brute force for systems of polynomial equations over finite fields2018-07-16Paper
Beating brute force for (quantified) satisfiability of circuits of bounded treewidth2018-03-15Paper
Subquadratic algorithms for succinct stable matching2016-07-25Paper
Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility2016-04-15Paper
Size-depth trade-offs for threshold circuits2015-05-07Paper
Jealousy graphs: structure and complexity of decentralized stable matching2015-01-12Paper
On the complexity of circuit satisfiability2014-08-13Paper
Finding heavy hitters from lossy or noisy data2013-10-04Paper
On the exact complexity of evaluating quantified \(k\)-\textsc{cnf}2013-05-16Paper
Common Knowledge and State-Dependent Equilibria2013-03-13Paper
On the exact complexity of evaluating quantified \(k\)-CNF2010-12-07Paper
Uniquely satisfiable \(k\)-SAT instances with almost minimal occurrences of each variable2010-09-29Paper
The complexity of satisfiability of small depth circuits2010-01-14Paper
k-SAT Is No Harder Than Decision-Unique-k-SAT2009-08-18Paper
An improved exponential-time algorithm for k -SAT2008-12-21Paper
The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs2008-03-11Paper
https://portal.mardi4nfdi.de/entity/Q54609252005-07-20Paper
On the complexity of \(k\)-SAT2002-08-14Paper
Which problems have strongly exponential complexity?2002-07-04Paper
Scalable network architectures using the optical transpose interconnection system (OTIS)2001-10-01Paper
https://portal.mardi4nfdi.de/entity/Q45269732001-02-28Paper
Exponential lower bounds for depth three Boolean circuits2000-12-19Paper
https://portal.mardi4nfdi.de/entity/Q44846622000-05-29Paper
Dimension of Projections in Boolean Functions1998-09-21Paper
Size--Depth Tradeoffs for Threshold Circuits1997-05-26Paper
Approximating threshold circuits by rational functions1995-08-27Paper
The light bulb problem1995-07-06Paper
Effect of connectivity in an associative memory model1994-01-06Paper
https://portal.mardi4nfdi.de/entity/Q40135441992-09-27Paper
Milking the Aanderaa argument1990-01-01Paper
There are no p-complete families of symmetric Boolean functions1989-01-01Paper
Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques1988-01-01Paper
Probabilistic communication complexity1986-01-01Paper

Research outcomes over time

This page was built for person: Ramamohan Paturi