„Derandomization“
Suchergebnisse
138 Treffer
-
Algebra in Computational Complexity (Dagstuhl Seminar 14391)
-
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set
-
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421)
-
Parallel Complexity of Geometric Bipartite Matching
-
Massively Parallel Ruling Set Made Deterministic
-
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
-
Matrix Multiplication Verification Using Coding Theory
-
Leakage-Resilient Hardness Equivalence to Logspace Derandomization
-
BPL ⊆ L-AC¹
-
The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise
-
Finding Missing Items Requires Strong Forms of Randomness
-
Derandomizing Logspace with a Small Shared Hard Drive
-
On the Exact Matching Problem in Dense Graphs
-
A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization
-
A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian
-
Online Disjoint Set Covers: Randomization Is Not Necessary
-
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381)
-
Unconditional Lower Bounds against Advice
-
08381 Executive Summary – Computational Complexity of Discrete Problems
-
Pseudorandom Linear Codes Are List-Decodable to Capacity