BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
3 × USA
Collaborated with:
D.Grigoriev M.Karpinski F.M.a.d.Heide A.K.Chandra P.Raghavan W.L.Ruzzo P.Tiwari
Talks about:
algebra (2) lower (2) bound (2) complex (1) circuit (1) boolean (1) theori (1) resist (1) random (1) method (1)

Person: Roman Smolensky

DBLP DBLP: Smolensky:Roman

Contributed to:

STOC 19961996
STOC 19891989
STOC 19871987

Wrote 3 papers:

STOC-1996-GrigorievKHS #algebra #bound #random
A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.
STOC-1989-ChandraRRST #graph
The Electrical Resistance of a Graph Captures its Commute and Cover Times (AKC, PR, WLR, RS, PT), pp. 574–586.
STOC-1987-Smolensky #algebra #bound #complexity #formal method
Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity (RS), pp. 77–82.

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.