( en | de | ru )

 

Disambiguation of "Umans, Christopher"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of Boolean formula minimization.

, and . J. Comput. Syst. Sci., 77 (1): 142-153 (2011)

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.

Anna Chana-Golda Umanska

Erwin Umanski

Christopher Christopher

Jörg Christopher

Christopher Reynolds

 

Other publications of authors with the same name

On sunflowers and matrix multiplication., , and . Comput. Complex., 22 (2): 219-243 (2013)Pseudorandomness for Approximate Counting and Sampling, and . Electron. Colloquium Comput. Complex., (2004)On beating the hybrid argument., , , and . Electron. Colloquium Comput. Complex., (2010)The complexity of Boolean formula minimization., and . J. Comput. Syst. Sci., 77 (1): 142-153 (2011)Fast Modular Composition in any Characteristic., and . FOCS, page 146-155. IEEE Computer Society, (2008)A Group-Theoretic Approach to Fast Matrix Multiplication., and . FOCS, page 438-449. IEEE Computer Society, (2003)The Minimum Equivalent DNF Problem and Shortest Implicants.. FOCS, page 556-563. IEEE Computer Society, (1998)Simple extractors for all min-entropies and a new pseudorandom generator., and . J. ACM, 52 (2): 172-216 (2005)Fast polynomial factorization and modular composition in small characteristic.. STOC, page 481-490. ACM, (2008)On the Complexity and Inapproximability of Shortest Implicant Problems.. ICALP, volume 1644 of Lecture Notes in Computer Science, page 687-696. Springer, (1999)