Cover Image

A near-optimal Quadratic Goldreich-Levin algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Briët, Jop, Castro-Silva, Davi
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the threshold for Szemerédi's theorem with random differences
by: Briët, Jop, et al.
Published: (2023)

Noisy decoding by shallow circuits with parities: classical and quantum
by: Briët, Jop, et al.
Published: (2023)

Random restrictions of high-rank tensors and polynomial maps
by: Briët, Jop, et al.
Published: (2022)

Discreteness of asymptotic tensor ranks
by: Briët, Jop, et al.
Published: (2023)

An algorithmic Polynomial Freiman-Ruzsa theorem
by: Castro-Silva, Davi, et al.
Published: (2026)

Grothendieck inequalities characterize converses to the polynomial method
by: Briët, Jop, et al.
Published: (2022)

Clifford testing: algorithms and lower bounds
by: Hinsche, Marcel, et al.
Published: (2025)

Improved Condensers for Chor-Goldreich Sources
by: Goodman, Jesse, et al.
Published: (2024)

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
by: Gan, Luyining, et al.
Published: (2023)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
by: Le, Hoang-Oanh, et al.
Published: (2023)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
by: Minevich, Igor, et al.
Published: (2024)

A Note on the Complexity of Directed Clique
by: Gutowski, Grzegorz, et al.
Published: (2026)

A combinatorial view of Holant problems on higher domains
by: Liu, Yin
Published: (2024)

A Subexponential Reduction from Product Partition to Subset Sum
by: Costandin, Marius
Published: (2024)

A criterion for Andrásfai--Erdős--Sós type theorems and applications
by: Hou, Jianfeng, et al.
Published: (2024)

A Hypergraph Container Method on Spread SAT: Approximation and Speedup
by: Han, Zicheng, et al.
Published: (2026)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
by: Eagling-Vose, Tala, et al.
Published: (2025)

Refuting Perfect Matchings in Spectral Expanders is Hard
by: Biswas, Ari, et al.
Published: (2025)

Monotone Circuit Complexity of Matching
by: Cavalar, Bruno, et al.
Published: (2025)

Hunting a rabbit: complexity, approximability and some characterizations
by: Ben-Ameur, Walid, et al.
Published: (2025)

Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2025)

Improved Small Set Expansion in High Dimensional Expanders
by: Kaufman, Tali, et al.
Published: (2025)

Assembly Addition Chains
by: Cronin, Leroy, et al.
Published: (2025)

Tensor rank and dimension expanders
by: Dvir, Zeev
Published: (2025)

Interactive Proofs For Distribution Testing With Conditional Oracles
by: Biswas, Ari, et al.
Published: (2025)

Matchgate signatures under variable permutations
by: Meng, Boning, et al.
Published: (2025)

Hardness of Hypergraph Edge Modification Problems
by: Gishboliner, Lior, et al.
Published: (2025)

Sensitivity and Hamming graphs
by: Asensio, Sara, et al.
Published: (2025)

Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics
by: Mittal, Kunal
Published: (2025)

The Log-Rank Conjecture: New Equivalent Formulations
by: Hambardzumyan, Lianna, et al.
Published: (2025)

Finding a HIST: Chordality, Structural Parameters, and Diameter
by: Hanaka, Tesshu, et al.
Published: (2025)

Factorization norms and Zarankiewicz problems
by: Tomon, István
Published: (2025)

Low-Degree Polynomials Are Good Extractors
by: Alrabiah, Omar, et al.
Published: (2024)

Direct Product Primality Testing of Graphs is GI-hard
by: Calderoni, Luca, et al.
Published: (2020)

On the Keevash-Knox-Mycroft Conjecture
by: Gan, Luyining, et al.
Published: (2022)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
by: Borzechowski, Michaela, et al.
Published: (2023)

Sparse juntas on the biased hypercube
by: Dinur, Irit, et al.
Published: (2017)

Improved Lower Bounds for all Odd-Query Locally Decodable Codes
by: Basu, Arpon, et al.
Published: (2024)

On Approximability of Satisfiable $k$-CSPs: VI
by: Bhangale, Amey, et al.
Published: (2024)