Joshua Brakensiek

Available identifiers

zbMath Open brakensiek.joshuaMaRDI QIDQ2090126

List of research outcomes

Publication	Date of Publication	Type
Improved field size bounds for higher order MDS codes	2025-01-23	Paper
Tight approximability of MAX 2-SAT and relatives, under UGC	2024-11-28	Paper
Conditional dichotomy of Boolean ordered promise CSPs	2024-07-03	Paper
SDPs and robust satisfiability of promise CSP	2024-05-08	Paper
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes	2024-03-14	Paper
Robust Factorizations and Colorings of Tensor Graphs	2024-03-14	Paper
On the mysteries of MAX NAE-SAT	2024-01-15	Paper
Generalized GM-MDS: Polynomial Codes are Higher Order MDS	2023-10-19	Paper
AG codes achieve list decoding capacity over contant-sized fields	2023-10-19	Paper
Kapranov degrees	2023-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q6176154	2023-07-25	Paper
The resolution of Keller's conjecture	2022-11-09	Paper
The resolution of Keller's conjecture	2022-10-24	Paper
Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy	2022-08-17	Paper
Generic Reed-Solomon codes achieve list-decoding capacity	2022-06-10	Paper
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations	2022-06-08	Paper
The Quest for Strong Inapproximability Results with Perfect Completeness	2022-02-16	Paper
Vertex isoperimetry and independent set stability for tensor powers of cliques	2021-07-28	Paper
The quest for strong inapproximability results with perfect completeness	2021-07-28	Paper
Symmetric Polymorphisms and Efficient Decidability of Promise CSPs	2021-02-02	Paper
Constant-factor approximation of near-linear edit distance in near-linear time	2021-01-19	Paper
The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems	2020-12-04	Paper
Bridging between 0/1 and linear programming via random walks	2020-01-30	Paper
CSPs with global modular constraints: algorithms and hardness via polynomial representations	2020-01-30	Paper
An algorithmic blend of LPs and ring equations for promise CSPs	2019-10-15	Paper
The Resolution of Keller's Conjecture	2019-10-08	Paper
Coded trace reconstruction in a constant number of traces	2019-08-12	Paper
Efficient low-redundancy codes for correcting multiple deletions	2018-09-14	Paper
Efficient low-redundancy codes for correcting multiple deletions	2018-07-16	Paper
Promise constraint satisfaction: structure theory and a symmetric Boolean dichotomy	2018-03-15	Paper
New hardness results for graph and hypergraph colorings	2017-10-10	Paper
Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees	2013-01-16	Paper
Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes	N/A	Paper

Research outcomes over time

This page was built for person: Joshua Brakensiek