( en | de | ru )

 

Disambiguation of "Smolensky, Roman"

Author of the publication

copydeleteadd this publication to your clipboard
The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)

, , , , , and . FOCS, page 396-407. IEEE Computer Society, (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peter Hermann Smolensky

Ute Romann

Christoph Romanowski

Maria-Elena Romansky-Rieken

Georg Romanowski

 

Other publications of authors with the same name

Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract), and . FOCS, page 632-641. IEEE Computer Society, (1990)0-8186-2082-X.Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. STOC, page 77-82. ACM, (1987)On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates. FOCS, page 628-631. IEEE Computer Society, (1990)0-8186-2082-X.A Lower Bound for Randomized Algebraic Decision Trees., , , and . STOC, page 612-619. ACM, (1996)The Electrical Resistance of a Graph Captures its Commute and Cover Times, , , and . Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, page 574--586. New York, NY, USA, ACM, (1989)A Lower Bound for Randomized Algebraic Decision Trees., , , and . Comput. Complex., 6 (4): 357-375 (1997)Lower Bounds for Polynomial Evaluation and Interpolation Problems, and . FOCS, page 378-383. IEEE Computer Society, (1991)The Bit Extraction Problem of t-Resilient Functions (Preliminary Version), , , , , and . FOCS, page 396-407. IEEE Computer Society, (1985)On Lower Bounds for Read-K-Times Branching Programs., , and . Comput. Complex., (1993)On Representations by Low-Degree Polynomials. FOCS, page 130-138. IEEE Computer Society, (1993)