scientific article; zbMATH DE number 1775419

zbMath1028.68065MaRDI QIDQ4542552

Sanjeev Arora

Publication date: 1 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

CHROMATIC NUMBERMAX-3SATMAX-CLIQUEPCP-based inapproximabilitySET-COVER

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (6)

Algebraic testing and weight distributions of codes. ⋮ A computational-level explanation of the speed of goal inference ⋮ Rational analysis, intractability, and the prospects of `as if'-explanations ⋮ Embracing the giant component ⋮ A computational complexity analysis of tunable type inference for Generic Universe Types ⋮ Interactive and probabilistic proof-checking

This page was built for publication: