( en | de | ru )

 

Disambiguation of "Goldmann, Mikael"

Author of the publication

copydeleteadd this publication to your clipboard
Majority Gates vs. General Weighted Threshold Gates.

, , and . SCT, page 2-13. IEEE Computer Society, (1992)

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.

Mikael Simons

Mikael Vaaraniemi

Mikael Högqvist

Mikael Agopov

Mikael Berndtsson

 

Other publications of authors with the same name

Simulating Threshold Circuits by Majority Circuits., and . SIAM J. Comput., 27 (1): 230-246 (1998)The Complexity of Solving Equations over Finite Groups., and . CCC, page 80-86. IEEE Computer Society, (1999)Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract)., and . STOC, page 569-574. ACM, (1995)Simulating threshold circuits by majority circuits., and . STOC, page 551-560. ACM, (1993)Majority Gates vs. General Weighted Threshold Gates., , and . SCT, page 2-13. IEEE Computer Society, (1992)On the Power of Small-Depth Threshold Circuits, and . FOCS, page 610-618. IEEE Computer Society, (1990)0-8186-2082-X.Monotone Circuits for Connectivity Have Depth (log n)2-o(1)., and . SIAM J. Comput., 27 (5): 1283-1294 (1998)A Simple Lower Bound for Monotone Clique Using a Communication Game., and . Inf. Process. Lett., 41 (4): 221-226 (1992)The Complexity of Computing Hard Core Predicates., and . CRYPTO, volume 1294 of Lecture Notes in Computer Science, page 1-15. Springer, (1997)Spectral Bounds on General Hard Core Predicates., and . STACS, volume 1770 of Lecture Notes in Computer Science, page 614-625. Springer, (2000)