Pseudorandomness In Computer Science and In Additive Combinatorics

Luca Trevisan

Type: Book-Chapter

Publication Date: 2010-01-01

Citations: 4

DOI: https://doi.org/10.1007/978-3-642-14444-8_19

View Publication

Locations

Bolyai Society mathematical studies - View

Similar Works

Action	Title	Year	Authors
+	Additive Combinatorics and Theoretical Computer Science	2009	Luca Trevisan
+	Structure and Randomness in Complexity Theory and Additive Combinatorics	2019	Seyed Kaave Hosseini
+ PDF Chat	None	2017	Shachar Lovett
+	Quasirandom additive sets and Cayley hypergraphs	2023	Davi Castro-Silva
+ PDF Chat	Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications	2014	Eli Ben‐Sasson Noga Ron‐Zewi Madhur Tulsiani Julia Wolf
+	On the different notions of pseudorandomness	2008	Markus Maucher Uwe Schöning Hans A. Kestler
+	Pseudorandomness	2012	Salil Vadhan
+ PDF Chat	Non-Algorithmic Theory of Randomness	2020	Vladimir Vovk
+ PDF Chat	Pseudorandomness via the Discrete Fourier Transform	2018	Parikshit Gopalan Daniel M. Kane Raghu Meka
+ PDF Chat	Pseudorandomness of the Ostrowski sum-of-digits function	2018	Lukas Spiegelhofer
+ PDF Chat	http://discreteanalysisjournal.com/article/2105-notes-on-nilspaces-algebraic-aspects	2018	Pablo Candela
+	Quasirandomness in additive groups and hypergraphs	2021	Davi Castro-Silva
+	Quasirandomness in additive groups and hypergraphs	2021	Davi Castro-Silva
+ PDF Chat	Decompositions, approximate structure, transference, and the Hahn-Banach theorem	2010	W. T. Gowers
+	Pseudorandomness and combinatorial constructions	2007	Luca Trevisan
+	Comparing computational entropies below majority (or: When is the dense model theorem false?)	2020	Russell Impagliazzo Sam McGuire
+ PDF Chat	Special issue from RANDOM’09: Editors’ Foreword	2012	Oded Goldreich Salil Vadhan
+	Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness	2024	Jiatu Li Edward Pyne Roei Tell
+	Irregularities of Distribution, Derandomization, and Complexity Theory	2000	Bernard Chazelle
+	Pseudorandomness and Combinatorial Constructions	2006	Luca Trevisan

Works That Cite This (4)

Action	Title	Year	Authors
+ PDF Chat	A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma	2011	Domingos Dellamonica Subrahmanyam Kalyanasundaram Daniel M. Martin Vojtěch Rödl A. Shapira
+ PDF Chat	Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition	2013	Khodakhast Bibak
+	Subset Sum in the Absence of Concentration	2015	Per Austrin Petteri Kaski Mikko Koivisto Jesper Nederlof
+	Turing machine algorithms and studies in quasi-randomness	2011	Subrahmanyam Kalyanasundaram

Works Cited by This (32)

Action	Title	Year	Authors
+ PDF Chat	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi
+	Computational Analogues of Entropy	2003	Boaz Barak Ronen Shaltiel Avi Wigderson
+ PDF Chat	The ergodic and combinatorial approaches to Szemerédi’s theorem	2007	Terence Tao
+	An inverse theorem for the Gowers U^{s+1}[N]-norm (announcement)	2010	Ben Green Terence Tao Tamar Ziegler
+ PDF Chat	Dense Subsets of Pseudorandom Sets	2008	Omer Reingold Luca Trevisan Madhur Tulsiani Salil Vadhan
+ PDF Chat	Linear Forms and Higher-Degree Uniformity for Functions On $${\mathbb{F}^{n}_{p}}$$	2011	W. T. Gowers Jason B. Wolf
+	Szemer'edi's regularity lemma revisited	2006	Terence Tao
+ PDF Chat	A Quantitative Ergodic Theory Proof of Szemerédi's Theorem	2006	Terence Tao
+	Lower bounds of tower type for Szemerédi's uniformity lemma	1997	W. T. Gowers
+	Theory and application of trapdoor functions	1982	Andrew Chi-Chih Yao