( en | de | ru )

 

Disambiguation of "McKenzie, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Does Looking Inside a Circuit Help?.

, , , , and . MFCS, volume 83 of LIPIcs, page 1:1-1:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Edwin McKenzie

Craig McKenzie

Tom McKenzie

Russell McKenzie Deighton

Mary M McKenzie

 

Other publications of authors with the same name

Oracle Branching Programs and Logspace versus P., and . MFCS, volume 379 of Lecture Notes in Computer Science, page 370-379. Springer, (1989)The Complexity of Solitaire., and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 182-193. Springer, (2007)The Power of Programs over Monoids in DA., , and . MFCS, volume 83 of LIPIcs, page 2:1-2:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The complexity of Solitaire., and . Theor. Comput. Sci., 410 (50): 5252-5260 (2009)Parallel complexity and permutation groups.. University of Toronto, Canada, (1984)The Complexity of Membership Problems for Circuits over Sets of Natural Numbers., and . STACS, volume 2607 of Lecture Notes in Computer Science, page 571-582. Springer, (2003)On the Complexity of Some Problems on Groups Input as Multiplication Tables., , , and . CCC, page 62-69. IEEE Computer Society, (2000)Incremental Branching Programs., , and . CSR, volume 3967 of Lecture Notes in Computer Science, page 178-190. Springer, (2006)Can Chimps Go It Alone?. DCFS, volume 8031 of Lecture Notes in Computer Science, page 17. Springer, (2013)Tameness and the power of programs over monoids in DA., , and . Log. Methods Comput. Sci., (2022)