Upload
Featured Recent Articles Topics Login Upload

Search Results for ''

published presentations and documents on DocSlides.

iO with Exponential Efficiency
iO with Exponential Efficiency
by cheryl-pisano
Huijia. Lin (USB), . Rafael Pass . (Cornell). Ka...
The Strange Link between Incompressibility and Complexity
The Strange Link between Incompressibility and Complexity
by marina-yarberry
China Theory Week, Aarhus. August 13, 2012. Today...
Circuit Complexity and Derandomization
Circuit Complexity and Derandomization
by terrificycre
Tokyo Institute of Technology. Akinori. Kawachi. ...
CS151 Complexity Theory Lecture 15
CS151 Complexity Theory Lecture 15
by oconnor
May 23, 2023. May 23, 2023. Arthur-Merlin Games. D...
Beating Brute Force Search for QBF
Beating Brute Force Search for QBF
by faustina-dinatale
Satisfiability. Rahul. . Santhanam. University o...
NP-Completeness
NP-Completeness
by myesha-ticknor
Dr. Yingwu Zhu. Chapter 34. 2. NP-Completeness. P...
Non-Uniform
Non-Uniform
by test
ACC Circuit Lower Bounds. Ryan Williams . IBM...
Non-Uniform
Non-Uniform
by tawny-fly
ACC Circuit Lower Bounds. Ryan Williams . IBM...
Random projections and depth hierarchy theorems
Random projections and depth hierarchy theorems
by myesha-ticknor
Rocco Servedio. Columbia University. St. Petersbu...
Generalization and
Generalization and
by pasty-toler
Specialization of Kernelization. Daniel Lokshtano...
Two Query PCP with
Two Query PCP with
by karlyn-bohler
Sub-constant Error. Dana . Moshkovitz. Princeton ...
Non-Uniform ACC Circuit Lower Bounds
Non-Uniform ACC Circuit Lower Bounds
by natalie
Ryan Williams . IBM . Almaden. TexPoint. font...
An average-case lower bound against ACC
An average-case lower bound against ACC
by rose
0. Joint work with . Ruiwen Chen. and . Rahul ...
Circuit Lower Bounds A combinatorial approach to P
Circuit Lower Bounds A combinatorial approach to P
by megan
vs. NP. Shachar. Lovett. Computation. Input. Mem...
Direct Product : Decoding & Testing
Direct Product : Decoding & Testing
by ellena-manuel
Russell . Impagliazzo. ( IAS & UCSD )...
Circuit Lower Bounds
Circuit Lower Bounds
by pasty-toler
A combinatorial approach to P . vs. NP. Shachar....
Models of Exact Algorithms for NP-Hard Problems
Models of Exact Algorithms for NP-Hard Problems
by lois-ondreau
Rahul. . Santhanam. University of Edinburgh. Pla...
NP-complete
NP-complete
by tatiana-dople
examples. CSCI3130 Tutorial . 10. Chun-Ho Hung. ...
Random Quantum Circuits are Unitary Polynomial-Designs
Random Quantum Circuits are Unitary Polynomial-Designs
by alida-meadow
Fernando . G.S.L. . Brand. ão. 1. . Aram Harrow...
Proof Complexity Tutorial
Proof Complexity Tutorial
by lois-ondreau
:. . The Basics, Accomplishments, Connections an...