scientific article; zbMATH DE number 1114048
From MaRDI portal
Publication:4375817
zbMath0896.11051MaRDI QIDQ4375817
Carsten Rössner, Jean-Pierre Seifert
Publication date: 1 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityapproximation algorithmNP-hardprobabilistically checkable proofs2-prover 1-round interactive proof-systemsgood diophantine approximation
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10)
Related Items (2)
An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\) ⋮ Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design
This page was built for publication: