On polynomially many queries to NP or QMA oracles

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=NB9sUz_9HRo


Duration: 32:41
126 views
3

13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
http://itcs-conf.org/

On polynomially many queries to NP or QMA oracles

Dorian Rudolph (Paderborn University)
Sevag Gharibian (Universität Paderborn)

https://doi.org/10.4230/LIPIcs.ITCS.2022.75



Other Videos By Simons Institute for the Theory of Computing


2022-01-28Uniform Bounds for Scheduling with Job Size Estimates
2022-01-28Cursed yet Satisfied Agents
2022-01-28Lifting With Sunflowers
2022-01-28Improved Hardness of BDD and SVP Under Gap-(S)ETH
2022-01-28Online Multivalid Learning: Means, Moments, and Prediction Intervals
2022-01-28Low-bandwidth recovery of linear functions of Reed-Solomon-encoded data
2022-01-28Extremely Deep Proofs
2022-01-28Balanced Allocations with Incomplete Information: The Power of Two Queries
2022-01-28Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributi
2022-01-28What Does Dynamic Optimality Mean in External Memory?
2022-01-28On polynomially many queries to NP or QMA oracles
2022-01-28The importance of the spectral gap in estimating ground-state energies
2022-01-28Polynomial Identity Testing via Evaluation of Rational Functions
2022-01-28Almost-Orthogonal Bases for Inner Product Polynomials
2022-01-28More Dominantly Truthful Multi-task Peer Prediction with a Finite Number of Tasks
2022-01-28Classical algorithms and quantum limitations for maximum cut on high-girth graphs
2022-01-28Budget-Smoothed Analysis for Submodular Maximization
2022-01-28Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions
2022-01-28Lower Bounds on Stabilizer Rank
2022-01-28Geometric Bounds on the Fastest Mixing Markov Chain
2022-01-28A variant of the VC-dimension with applications to depth-3 circuits