Spatial codes and the hardness of string folding problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 639-648

  Nayak, Ashwin ^a   Sinclair, Alistair ^a   Zwick, Uri ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERROR CORRECTION; MATHEMATICAL MODELS; POLYNOMIALS;

STRING FOLDING PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032266010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)