Остановите войну!
for scientists:
default search action
Ramamohan Paturi
- > Home > Persons > Ramamohan Paturi
Publications
- 2016
- [c33]Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility. ITCS 2016: 261-270 - 2015
- [i10]Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i9]Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider:
0-1 Integer Linear Programming with a Linear Number of Constraints. CoRR abs/1401.5512 (2014) - [i8]Russell Impagliazzo, Shachar Lovett, Ramamohan Paturi, Stefan Schneider:
0-1 Integer Linear Programming with a Linear Number of Constraints. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j21]Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k -CNF. Algorithmica 65(4): 817-827 (2013) - [c32]Lucia Batman, Russell Impagliazzo, Cody Murray, Ramamohan Paturi:
Finding Heavy Hitters from Lossy or Noisy Data. APPROX-RANDOM 2013: 347-362 - [c31]Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider:
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. FOCS 2013: 479-488 - [c30]Russell Impagliazzo, Ramamohan Paturi:
Exact Complexity and Satisfiability - (Invited Talk). IPEC 2013: 1-3 - 2012
- [c26]Russell Impagliazzo, William Matthews, Ramamohan Paturi:
A satisfiability algorithm for AC0. SODA 2012: 961-972 - [i5]Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider:
A Satisfiability Algorithm for Sparse Depth-2 Threshold Circuits. CoRR abs/1212.4548 (2012) - 2011
- [i4]Russell Impagliazzo, William Matthews, Ramamohan Paturi:
A Satisfiability Algorithm for AC$^0$. CoRR abs/1107.3127 (2011) - 2010
- [c24]Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
On the Exact Complexity of Evaluating Quantified k-CNF. IPEC 2010: 50-59 - 2009
- [c18]Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
The Complexity of Satisfiability of Small Depth Circuits. IWPEC 2009: 75-85 - 2008
- [j20]Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi:
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. J. Comput. Syst. Sci. 74(3): 386-393 (2008) - 2006
- [c16]Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
A Duality between Clause Width and Clause Density for SAT. CCC 2006: 252-260 - 2003
- [c14]Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi:
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. CCC 2003: 135- - 2001
- [j18]Russell Impagliazzo, Ramamohan Paturi:
On the Complexity of k-SAT. J. Comput. Syst. Sci. 62(2): 367-375 (2001) - [j17]Russell Impagliazzo, Ramamohan Paturi, Francis Zane:
Which Problems Have Strongly Exponential Complexity? J. Comput. Syst. Sci. 63(4): 512-530 (2001) - 1999
- [c13]Russell Impagliazzo, Ramamohan Paturi:
Complexity of k-SAT. CCC 1999: 237-240 - 1998
- [c11]Russell Impagliazzo, Ramamohan Paturi, Francis Zane:
Which Problems Have Strongly Exponential Complexity? FOCS 1998: 653-663 - 1997
- [j12]Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks:
Size-Depth Tradeoffs for Threshold Circuits. SIAM J. Comput. 26(3): 693-707 (1997) - 1993
- [c8]Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks:
Size-depth trade-offs for threshold circuits. STOC 1993: 541-550
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint