Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Dan Gutfreund
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Related publications
Lower Bounds for Swapping Arthur and Merlin
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On Lower Bounds of Exponential Frames
Journal of Fourier Analysis and Applications
Mathematics
Applied Mathematics
Analysis
Sampling-Based Lower Bounds for Counting Queries
Intelligenza Artificiale
Artificial Intelligence
Exponential Lower Bounds for the Pigeonhole Principle
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures
Quantum Nonexpander Problem Is Quantum-Merlin-Arthur-Complete
Physical Review A
Lower Bounds
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Statistics of the MLE and Approximate Upper and Lower Bounds—Part I: Application to TOA Estimation
IEEE Transactions on Signal Processing
Electronic Engineering
Signal Processing
Electrical
