( en | de | ru )

 

Disambiguation of "Jukna, Stasys"

Author of the publication

copydeleteadd this publication to your clipboard
Top-Down Lower Bounds for Depth-Three Circuits.

, , and . Comput. Complex., 5 (2): 99-112 (1995)

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.

Stasys Sereika

Stasys Juzenas

Johannes Jukna

Stasys Maziliauskas

Stasys Samu is

 

Other publications of authors with the same name

Lower Bounds for DeMorgan Circuits of Bounded Negation Width., and . STACS, volume 126 of LIPIcs, page 41:1-41:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lower bounds for Boolean circuits of bounded negation width., and . J. Comput. Syst. Sci., (2022)Notes on Boolean Read-k and Multilinear Circuits.. CoRR, (2022)Boolean Function Complexity Advances and Frontiers.. Bull. EATCS, (2014)The Effect of Null-Chains on the Complexity of Contact Schemes.. FCT, volume 380 of Lecture Notes in Computer Science, page 246-256. Springer, (1989)Clique Problem, Cutting Plane Proofs, and Communication Complexity.. Electron. Colloquium Comput. Complex., (2012)Expanders and time-restricted branching programs. Electron. Colloquium Comput. Complex., (2005)Disproving the single level conjecture. Electron. Colloquium Comput. Complex., (2005)Approximation Limitations of Pure Dynamic Programming., and . CoRR, (2020)Disproving the Single Level Conjecture.. SIAM J. Comput., 36 (1): 83-98 (2006)