No. Title Author Year
1 Hardness of Rainbow Coloring Hypergraphs Guruswami, Venkatesan et al. 2018
2 Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs Guruswami, Venkatesan et al. 2018
3 Efficiently Decodable Codes for the Binary Deletion Channel Guruswami, Venkatesan et al. 2017
4 Locality via Partially Lifted Codes Frank-Fischer, S. Luna et al. 2017
5 Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph Guruswami, Venkatesan et al. 2017
6 Subspace Designs Based on Algebraic Function Fields Guruswami, Venkatesan et al. 2017
7 Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere Bhattiprolu, Vijay et al. 2017
8 The Quest for Strong Inapproximability Results with Perfect Completeness Brakensiek, Joshua et al. 2017
9 New Hardness Results for Graph and Hypergraph Colorings Brakensiek, Joshua et al. 2016
10 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) Bulatov, Andrei A. et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 19


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI