Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Derandomization"”.
-
Better Hardness via Algorithms, and New Forms of Hardness versus Randomness
… circuit lower bounds follows from non-trivial derandomization. In this thesis we establish many new connections between hardness and pseudorandomness, strengthening and refining the classic works mentioned above. • New circuit lower bounds from non-trivial derandomization. Following Williams’ …
-
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
… perspective bringing together Streaming, Derandomization, and older works in Stack Machines. Our technical developments relate this new model with previous works in derandomization. For example, we show that to derandomize parts of BPP it is in some sense sufficient to derandomize BPNC (a …
-
Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness
… of a group on the bits of the codewords. * The derandomization capabilities of probability measures on the Hamming cube based on binary linear codes with good distance properties, and their variations. Highlights of our results include: * A general theorem that asserts that if the encoder uses …
-
Polynomial identity testing of read-once oblivious algebraic branching programs
… Using our hitting set results, this gives a derandomization of Noether Normalization in that case.
-
Polynomial ideals in algebraic complexity
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms