Treffer: On the hardness of approximating shortest integer relations among rational numbers
Title:
On the hardness of approximating shortest integer relations among rational numbers
Authors:
Source:
Theoretical Computer Science. 209:287-297
Publisher Information:
Elsevier BV, 1998.
Publication Year:
1998
Subject Terms:
computational complexity, 0102 computer and information sciences, 02 engineering and technology, NP-hard, probabilistically checkable proofs, Approximation algorithm, 01 natural sciences, 2-prover 1-round interactive proof systems, Theoretical Computer Science, Computational complexity, label cover, Probabilistically checkable proofs, 0202 electrical engineering, electronic engineering, information engineering, integer relations, ddc:510, Parallel algorithms in computer science, approximation algorithm, Integer relations, Label cover, Computer Science(all)
Document Type:
Fachzeitschrift
Article<br />Conference object
File Description:
application/xml; application/pdf
Language:
English
ISSN:
0304-3975
DOI:
10.1016/s0304-3975(97)00118-7
Access URL:
Rights:
Elsevier Non-Commercial
Accession Number:
edsair.doi.dedup.....dc79f0dd6302efb91aafa51e364ca43c
Database:
OpenAIRE
Weitere Informationen
zbMATH Open Web Interface contents unavailable due to conflicting licenses.