DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Seinosuke Toda
Seinosuke Toda
Nondeterministic Direct Product Reducations and the Success
The Power of Algorithmic Approaches to the Graph Isomorphism Problem
On the Probabilistic Closure of the Loose Unambiguous Hierarchy
The Complexity of Verifying Loop-Free Programs As
Download This PDF File
The Complexity of Verifying Loop-Free Programs As
On TC Lower Bounds for the Permanent
The Complexity of Equivalence Relations
Stal Aanderaa Hao Wang Lars Aarvik Martin Abadi Zohar Manna James
Lipics-CCC-2021-16.Pdf (1
Bibliography Y
39 Non-Uniform ACC Circuit Lower Bounds
Fixed-Polynomial Size Circuit Bounds
PSEUDORANDOMNESS and AVERAGE-CASE COMPLEXITY VIA UNIFORM REDUCTIONS Luca Trevisan and Salil Vadhan
Lecture 6 – a Non-Uniform Lower Bound Implies a Uniform Collapse Amnon Ta-Shma and Dean Doron
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Conference Info & Program
Some Results in Computational Complexity by Ali Juma a Thesis
Top View
Hitting-Sets for Roabp and Sum of Set-Multilinear Circuits
Efficient Indexing of Necklaces and Irreducible Polynomials Over Finite
Chicago Journal of Theoretical Computer Science the MIT Press
The Complexity of Equivalence Relations
On Polynomial Approximations to AC0
On a Theorem of Razborov
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky∗
Lecture 20: Interactive Protocol for the Permanent Lecturer: Heng Guo
The Complexity of Deciding Statistical Properties of Samplable Distributions
On Circuit Complexity Classes and Iterated Matrix Multiplication