scientific article; zbMATH DE number 1559564
From MaRDI portal
Publication:4527016
zbMath0968.68145MaRDI QIDQ4527016
No author found.
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Algebraic testing and weight distributions of codes. ⋮ On the hardness of the minimum height decision tree problem ⋮ Cube vs. Cube Low Degree Test. ⋮ Budget constrained minimum cost connected medians ⋮ PCP characterizations of NP: toward a polynomially-small error-probability ⋮ On membership comparable sets ⋮ ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network ⋮ Shorter arithmetization of nondeterministic computations ⋮ The approximability of non-Boolean satisfiability problems and restricted integer programming ⋮ Noisy interpolation of sparse polynomials in finite fields ⋮ Improved approximation algorithms for capacitated facility location problems ⋮ Pseudorandom generators without the XOR lemma ⋮ Approximate evaluations of characteristic polynomials of Boolean functions ⋮ Three-Player Entangled XOR Games are NP-Hard to Approximate ⋮ On the minimum label spanning tree problem ⋮ Self-correctors for Cryptographic Modules ⋮ Interactive and probabilistic proof-checking ⋮ Testing algebraic geometric codes ⋮ Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. ⋮ Approximation algorithms for terrain guarding.
This page was built for publication: