scientific article; zbMATH DE number 1263221
From MaRDI portal
Publication:4234093
zbMath0978.68527MaRDI QIDQ4234093
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (10)
Some recent strong inapproximability results ⋮ Sharing one secret vs. sharing many secrets. ⋮ Improved non-approximability results for minimum vertex cover with density constraints ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ On the hardness of approximating shortest integer relations among rational numbers ⋮ Zero knowledge and the chromatic number ⋮ A note on the subadditive network design problem ⋮ On succinct arguments and witness encryption from groups ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs ⋮ Maximizing agreements and coagnostic learning
This page was built for publication:
