( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)

, , , , , и . FOCS, стр. 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.

Peter Hermann Smolensky

Olga Romanow

Max Viktor Romanus

Christoph Romanowski

Maria-Elena Romansky-Rieken

 

Другие публикации лиц с тем же именем

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