BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × United Kingdom
3 × USA
Collaborated with:
M.E.Saks W.Matthews P.Pudlák F.Zane R.Impagliazzo
Talks about:
circuit (3) satisfi (2) complex (2) boolean (2) depth (2) threshold (1) exponenti (1) algorithm (1) polynomi (1) function (1)

Person: Ramamohan Paturi

DBLP DBLP: Paturi:Ramamohan

Contributed to:

SAT 20102010
STOC 20102010
STOC 19971997
STOC 19931993
STOC 19921992

Wrote 6 papers:

SAT-2010-MatthewsP #satisfiability
Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (WM, RP), pp. 369–374.
SAT-2010-Paturi #algorithm #complexity
Exact Algorithms and Complexity (RP), pp. 8–9.
STOC-2010-PaturiP #complexity #on the #satisfiability
On the complexity of circuit satisfiability (RP, PP), pp. 241–250.
STOC-1997-PaturiSZ #bound #exponential
Exponential Lower Bounds for Depth 3 Boolean Circuits (RP, MES, FZ), pp. 86–91.
STOC-1993-ImpagliazzoPS #trade-off
Size-depth trade-offs for threshold circuits (RI, RP, MES), pp. 541–550.
STOC-1992-Paturi #approximate #on the #symmetry
On the Degree of Polynomials that Approximate Symmetric Boolean Functions (RP), pp. 468–474.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.