( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Switching Functions Whose Monotone Complexity is Nearly Quadratic.

. Theor. Comput. Sci., (1979)

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.

Ingo Wegener

Wolfgang Ingold

Gert-Ludwig Ingold

Daniel P Ingold

Anna Ingólfsdóttir

 

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

Theoretische Informatik - eine algorithmenorientierte Einführung (2. Auflage). Teubner, (1999)The Range of New Lower Bound Techniques for WRAMs and Bounded Depth Circuits.. Elektronische Informationsverarbeitung und Kybernetik, 23 (10/11): 537-543 (1987)On the Complexity of Branching Programs and Decision Trees for Clique Functions.. TAPSOFT, Vol.1, том 249 из Lecture Notes in Computer Science, стр. 1-12. Springer, (1987)Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size., , и . MFCS, том 452 из Lecture Notes in Computer Science, стр. 523-529. Springer, (1990)Starthilfe Informatik, 2. Auflage, , , и . Vieweg+Teubner Verlag, (2000)Starthilfe Informatik, , , и . Vieweg+Teubner Verlag, (1998)Modified repeated median filters., , , и . Stat. Comput., 16 (2): 177-192 (2006)Switching Functions Whose Monotone Complexity is Nearly Quadratic.. Theor. Comput. Sci., (1979)On the Complexity of Slice Functions.. Theor. Comput. Sci., (1985)BDDs--design, analysis, complexity, and applications.. Discret. Appl. Math., 138 (1-2): 229-251 (2004)