DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Stathis Zachos
Stathis Zachos
Zero Knowledge and Circuit Minimization
Is It Easier to Prove Theorems That Are Guaranteed to Be True?
The Complexity of Nash Equilibria by Constantinos Daskalakis Diploma
Structure Vs. Hardness Through the Obfuscation Lens∗
Models of Parallel Computation and Parallel Complexity
Zero-Knowledge Interactive Proof Systems for New Lattice Problems
P Versus NP, and More
Stathis Zachos
Interactive Oracle Proofs?
The Computational Complexity of Some Games and Puzzles with Theoretical Applications
A Decisive Characterization of BPP
Relating Counting Complexity to Non-Uniform Probability Measures
On Interactive Proofs with a Laconic Prover
Stoqma Meets Distribution Testing
Robustness of Probabilistic Computational Complexity Classes Under Definitional Perturbations
Computational Complexity Classes
On Transformations of Interactive Proofs That Preserve the Prover's Complexity
The Complexity of Optimal Auction Design
Top View
The Computational Complexity of Some Games and Puzzles with Theoretical Applications
The Complexity of Equivalence Relations
Counting Hierarchies: Polynomial Time and Constant Depth Circuits
The Complexity of Zero Knowledge
Towards Perfect Completeness in QMA
Probabilistic Quantifiers and Games
16Th Conference on the Theory of Quantum Computation, Communication and Cryptography