( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table.

, , , , и . SIAM J. Comput., 38 (1): 63-84 (2008)

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.

Manno Saks

Weerasak Saksirirat

Ram Saksena

E Michael

Jolanda Saks-Surowicz

 

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

Explicit dispersers with polylog degree., , и . STOC, стр. 479-488. ACM, (1995)On Randomized Online Labeling with Polynomially Many Labels., , и . ICALP (1), том 7965 из Lecture Notes in Computer Science, стр. 291-302. Springer, (2013)Minimizing DNF Formulas and AC0 Circuits Given a Truth Table, , , , и . Electron. Colloquium Comput. Complex., (2005)A lower bound on the quantum query complexity of read-once functions., и . J. Comput. Syst. Sci., 69 (2): 244-258 (2004)An on-line graph coloring algorithm with sublinear performance ratio., , и . Discret. Math., 75 (1-3): 319-325 (1989)Lower Bounds on the Randomized Communication Complexity of Read-Once Functions., и . CCC, стр. 341-350. IEEE Computer Society, (2009)Randomization and Derandomization in Space_Bounded Computation.. CCC, стр. 128-149. IEEE Computer Society, (1996)Optimal Separation of EROW and CROWPRAMs., , и . CCC, стр. 93-. IEEE Computer Society, (2003)Parallel monotonicity reconstruction., и . SODA, стр. 962-971. SIAM, (2008)Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions., и . CCC, том 169 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)