-
21
-
22
Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation
Published 2018Journal article -
23
Hitting Sets for Low-Degree Polynomials with Optimal Density
Published 2015Subjects: “…Pseudorandomness…”
Get full text
Get full text
Conference Paper -
24
Cognitive Information Processing
Published 2010Subjects: “…Picture Transmission by Pseudorandom Scanning…”
Get full text
Technical Report -
25
-
26
Random and exact structures in combinatorics
Published 2024“…One central notion, the pseudorandomness-structure dichotomy, has played a key role in additive combinatorics and extremal graph theory. …”
Get full text
Thesis -
27
BQP and the Polynomial Hierarchy
Published 2010“…The original Linial-Nisan Conjecture (about pseudorandomness against constant-depth circuits) was recently proved by Braverman, after being open for twenty years.…”
Get full text
Get full text
Article -
28
Better Hardness via Algorithms, and New Forms of Hardness versus Randomness
Published 2023“…One central theme of complexity theory is the rich interplay between hardness (the existence of functions that are hard to compute) and pseudorandomness (the procedure that converts randomized algorithms into equivalent deterministic algorithms). …”
Get full text
Thesis -
29
Polynomial identity testing of read-once oblivious algebraic branching programs
Published 2014Get full text
Thesis -
30
Patterns hidden from simple algorithms
Published 2013“…The modern theory of pseudorandomness indeed manages to explain such phenomena, where strings appear random to simple minds. …”
Get full text
Article -
31
A relative Szemerédi theorem
Published 2017“…In this paper, we give a simple proof of a strengthening of the relative Szemerédi theorem, showing that a much weaker pseudorandomness condition is sufficient. Our strengthened version can be applied to give the first relative Szemerédi theorem for k-term arithmetic progressions in pseudorandom subsets of Z[subscript N] of density N[superscript −c[subscript k]]. …”
Get full text
Article -
32
From Quantum Information to Cosmic Censorship: Emergent Spacetimes and Their Surfaces
Published 2024“…Finally, we show a connection between event horizons and CFT pseudorandomness, and we construct a new measure of the size of a naked singularity. …”
Get full text
Get full text
Thesis -
33
-
34
-
35
-
36
Subspace designs based on algebraic function fields
Published 2018“…Forbes and Guruswami (RANDOM'15) used this construction to give explicit constant degree "dimension expanders" over large fields, and noted that subspace designs are a powerful tool in linear-algebraic pseudorandomness. Here, we construct subspace designs over any field, at the expense of a modest worsening of the bound $L$ on total intersection dimension. …”
Get full text
Get full text
Journal Article -
37
-
38
How some market random number generators are now known to be weak
Published 2020“…This project will evaluate three different known pseudorandom number generator algorithms used and investigate its possible vulnerabilities. …”
Get full text
Final Year Project (FYP) -
39
Cryptographic Censorship
Published 2025“…We illustrate that classical and semi-Planckian singularities are compatible with approximately pseudorandom CFT time evolution; thus, if such singularities are indeed approximately pseudorandom, by Cryptographic Censorship, they cannot exist in the absence of event horizons. …”
Get full text
Article -
40