Computational complexity: a conceptual perspective
O Goldreich - ACM Sigact News, 2008 - dl.acm.org
This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …
content, and that this contents should be explicitly communicated in expositions and courses …
A new frontier for IoT security emerging from three decades of key generation relying on wireless channels
The Internet of Things (IoT) is a transformative technology, which is revolutionizing our
everyday life by connecting everyone and everything together. The massive number of …
everyday life by connecting everyone and everything together. The massive number of …
[BOOK][B] An invitation to compressive sensing
This first chapter formulates the objectives of compressive sensing. It introduces the
standard compressive problem studied throughout the book and reveals its ubiquity in many …
standard compressive problem studied throughout the book and reveals its ubiquity in many …
Pseudorandomness
SP Vadhan - … and Trends® in Theoretical Computer Science, 2012 - nowpublishers.com
This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …
random" despite being constructed using little or no randomness. This theory has …
Sparse recovery using sparse matrices
In this paper, we survey algorithms for sparse recovery problems that are based on sparse
random matrices. Such matrices has several attractive properties: they support algorithms …
random matrices. Such matrices has several attractive properties: they support algorithms …
Approximate nearest neighbor search in high dimensions
The nearest neighbor problem is defined as follows: Given a set P of n points in some metric
space (X, D), build a data structure that, given any point q, returns a point in P that is closest …
space (X, D), build a data structure that, given any point q, returns a point in P that is closest …
Quantum computing at the quantum advantage threshold: a down-to-business review
AK Fedorov, N Gisin, SM Beloussov… - arxiv preprint arxiv …, 2022 - arxiv.org
It is expected that quantum computers would enable solving various problems that are
beyond the capabilities of the most powerful current supercomputers, which are based on …
beyond the capabilities of the most powerful current supercomputers, which are based on …
Trapdoor hash functions and their applications
We introduce a new primitive, called trapdoor hash functions (TDH), which are hash
functions H:{0, 1\}^ n → {0, 1\}^ λ with additional trapdoor function-like properties …
functions H:{0, 1\}^ n → {0, 1\}^ λ with additional trapdoor function-like properties …
[BOOK][B] Mathematics and computation: A theory revolutionizing technology and science
A Wigderson - 2019 - books.google.com
From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …
complexity theory, its connections and interactions with mathematics, and its central role in …
Explicit two-source extractors and resilient functions
E Chattopadhyay, D Zuckerman - Proceedings of the forty-eighth annual …, 2016 - dl.acm.org
We explicitly construct an extractor for two independent sources on n bits, each with
polylogarithmic min-entropy. Our extractor outputs one bit and has polynomially small error …
polylogarithmic min-entropy. Our extractor outputs one bit and has polynomially small error …