An Improved Bound on the Fraction of Correctable Deletions
Bukh, Boris, Guruswami, Venkatesan, Hastad, Johan
Published in IEEE transactions on information theory (01.01.2017)
Published in IEEE transactions on information theory (01.01.2017)
Get full text
Journal Article
On the List-Decodability of Random Linear Codes
Guruswami, Venkatesan, Håstad, Johan, Kopparty, Swastik
Published in IEEE transactions on information theory (01.02.2011)
Published in IEEE transactions on information theory (01.02.2011)
Get full text
Journal Article
Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound
Guruswami, Venkatesan, Hastad, Johan
Published in IEEE transactions on information theory (01.10.2021)
Published in IEEE transactions on information theory (01.10.2021)
Get full text
Journal Article
On small-depth Frege proofs for PHP
Hastad, Johan
Published in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (06.11.2023)
Published in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (06.11.2023)
Get full text
Conference Proceeding
On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited
Hastad, Johan, Risse, Kilian
Published in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2022)
Published in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2022)
Get full text
Conference Proceeding
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
Guruswami, Venkatesan, HÅstad, Johan, Manokaran, Rajsekar, Raghavendra, Prasad, Charikar, Moses
Published in SIAM journal on computing (01.01.2011)
Published in SIAM journal on computing (01.01.2011)
Get full text
Journal Article
Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPs
Hastad, Johan
Published in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2018)
Published in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2018)
Get full text
Conference Proceeding
Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers
Ekerå, Martin, Håstad, Johan
Published in 8th International Workshop on Post-Quantum Cryptography, PQCrypto 2017 (2017)
Published in 8th International Workshop on Post-Quantum Cryptography, PQCrypto 2017 (2017)
Get full text
Book Chapter
Conference Proceeding
d-Galvin Families
Håstad, Johan, Lagarde, Guillaume, Swernofsky, Joseph
Published in The Electronic journal of combinatorics (07.02.2020)
Published in The Electronic journal of combinatorics (07.02.2020)
Get full text
Journal Article