search result

Cover von Hardness of Rainbow Coloring Hypergraphs

Hardness of Rainbow Coloring Hypergraphs

Year: 2018
Media group: LIPIcs
Cover von Efficiently Decodable Codes for the Binary Deletion Channel

Efficiently Decodable Codes for the Binary Deletion Channel

Year: 2017
Media group: LIPIcs
Cover von Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph

Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph

Year: 2017
Media group: LIPIcs
Cover von The Quest for Strong Inapproximability Results with Perfect Completeness

The Quest for Strong Inapproximability Results with Perfect Completeness

Year: 2017
Media group: LIPIcs
Cover von Tight Bounds for Communication-Assisted Agreement Distillation

Tight Bounds for Communication-Assisted Agreement Distillation

Year: 2016
Media group: LIPIcs
Cover von New Hardness Results for Graph and Hypergraph Colorings

New Hardness Results for Graph and Hypergraph Colorings

Year: 2016
Media group: LIPIcs
Cover von Towards a Characterization of Approximation Resistance for Symmetric CSPs

Towards a Characterization of Approximation Resistance for Symmetric CSPs

Year: 2015
Media group: LIPIcs
Cover von Inapproximability of H-Transversal/Packing

Inapproximability of H-Transversal/Packing

Year: 2015
Media group: LIPIcs
Cover von Special issue on FOCS 2002; 4
43rd IEEE symposium on foundations of computer science, Vancouver, BC, November 16 - 19, 2002 : S. 701 - 860
Search for this author
Year: 2004
Publisher: Boston, Academic Press
Count: 4
Media group: SPECIAL ISSUE
Cover von 2000 Information Theory Society paper award; 3
S. 857 - 1271
Search for this author
Year: 2001
Publisher: Piscataway, IEEE
Count: 3
Media group: SPECIAL ISSUE
OPEN V 11.1.0.0