Focs 2025

27:40

Computing the Polytope Diameter is Even Harder than NP-hard
FOCS 2025
52 views
25:56

Adversarially robust quantum state learning and testing
FOCS 2025
No views
24:39

A distillation–teleportation protocol for fault-tolerant QRAM
FOCS 2025
No views
37:36

Faster logconcave sampling from a cold start in high dimension
FOCS 2025
No views
17:02

On the Impossibility of SNARGs with Short CRS
FOCS 2025
No views

2025 End of Year Graduation - Faculty of Creative Industries, Education and Social Justice 6
TheQUTube
20:24

Efficiently Batching Unambiguous Interactive Proofs
FOCS 2025
17 views
25:02

Distributed Triangle Detection is Hard in Few Rounds
FOCS 2025
No views
25:27

How Global Calibration Strengthens Multiaccuracy
FOCS 2025
No views
17:38

Optimal Smoothed Analysis of the Simplex Method
FOCS 2025
196 views
20:56

Lower Bounds for Non-adaptive Local Computation Algorithms
FOCS 2025
No views
16:36

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
FOCS 2025
No views
23:05

A Little Clairvoyance Is All You Need
FOCS 2025
No views
17:42

Computational-Statistical Tradeoffs from NP-hardness
FOCS 2025
55 views
19:41

Adaptivity Gaps for Stochastic Probing with Subadditive Functions
FOCS 2025
No views
18:53

Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
FOCS 2025
No views
25:55

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
FOCS 2025
No views
17:28

Optimal 4-Approximation for the Correlated Pandora’s Problem
FOCS 2025
No views
Today Top Searches
Categories
Recently Searched Keywords