DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Richard Lipton
Richard Lipton
Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems*
The Computational Complexity of Nash Equilibria in Concisely Represented Games∗
Towards Non-Black-Box Lower Bounds in Cryptography
Contents
Implementation of Elliptic Curve Cryptography in DNA Computing
Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines
Circuit Lower Bounds for Merlin-Arthur Classes
Michael Oser Rabin Automata, Logic and Randomness in Computation
Breaking the Model : Finalisation and a Taxonomy of Security Attack
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
17Th Knuth Prize: Call for Nominations
Laszlo Lovasz and Avi Wigderson Share the 2021 Abel Prize - 03-20-2021 by Abhigyan Ray - Gonit Sora
Some Estimated Likelihoods for Computational Complexity
The F Index: Quantifying the Impact of Coterminal Citations on Scientists’ Ranking
Approximating the Permanent with Deep Rejection Sampling
Algorithmic Finance Available to All
Two-Way Quantum Finite Automata and the Word Problem Zachary Remscrim Department of Mathematics, MIT, Cambridge, MA, USA
[email protected]
The Complexity of Analog Computation ²
Top View
Robust Simulations and Significant Separations
Lovász and Wigderson Awarded 2021 Abel Prize
Karp Transcript Final
Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch H
Contents U U U
Bibliography Y
A Sticker Based Model for DNA Computation
Doubts Continue on Claim to Have Solved P Vs NP Mathematical Question 17 August 2010, by Lin Edwards
UTIME Easy-Witness Lemma & Some Consequences
Realizable Paths and the Nl Vs L Problem
Yevgeniy Dodis Research Interests Education Professional Activities
The Fourth ACM Conference on Electronic Commerce
Visions for Theoretical Computer Science
Notices of the American Mathematical Society
18 Unconventional Essays on the Nature of Mathematics 18 Unconventional Essays on the Nature of Mathematics
Highly Cited Researchers (H>100) According to Their Google Scholar
DNA Encryption Algorithms: Scope and Challenges in Symmetric Key Cryptography
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
On Approximately Fair Allocations of Indivisible Goods∗
History and Contributions of Theoretical Computer Science
Challenges for Theory of Computing
Self-Testing/Correcting for Polynomials and for Approximate Functions
Noisy Interpolation of Sparse Polynomials, and Applications
Computer Scientist Finds Small-Memory Algorithm for Fundamental Graph Problem
Cryptographic Postage Indicia
Lecture 15 1 Introduction
Department of Computer Science School of Engineering and Applied Science University of Virginia
Social Processes and Proofs of Theorems and Programs
Robust Simulations and Significant Separations
19Th Knuth Prize: Call for Nominations
Cheaper by the Dozen: Batched Algorithms∗
Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems