Bibliographic details on derandomization of algebraic and geometric problems in theoretical computer science.
People also ask
Is algebraic geometry used in computer science?
May 13, 2013 · The results of [GCT5] show that explicitly derandomizing Noether's Normalization Lemma is essentially equivalent to the notorious open problem ...
This is the first HSG in the algebraic setting that yields a complete derandomization of polynomial identity testing (PIT) for general circuits from a suitable ...
We survey techniques for replacing randomized algorithms in computational geometry by deterministic ones with a similar asymptotic running time.
Dec 6, 2009 · Polymath4 is devoted to a question about derandomization: To find a deterministic polynomial time algorithm for finding a k-digit prime.
The aim of this thesis is to provide deterministic upper bounds for various naturally occuring computational problems. We begin this thesis with a study of ...
Abstract—It is shown that black-box derandomization of polynomial identity testing (PIT) is essentially equivalent to derandomization of Noether's ...
This thesis investigates the design of geometric algorithms, the worst-case running time of which is asymptotically equivalent (within a constant factor) to ...
Missing: algebraic | Show results with:algebraic
(4) A unified geometric complexity theory (GCT) approach to derandomization and classification is formulated on the basis of this equivalence. Published in: ...
May 10, 2018 · I would like to learn about what Theoretical Computer Science is for academia and what background someone needs to become a theoretical computer scientist.
Missing: derandomization | Show results with:derandomization