43rd Symposium on Foundations of Computer Science (FOCS 2002)

Collects the 77 papers presented during the November 2002 symposium on the mathematical foundations of computing. Among the topics are abstract combinatorial programs and efficient property testers, a lower bound for testing 3-colorability in bounded degree graphs, a spectral algorithm for learning...

Ausführliche Beschreibung

Gespeichert in:
Körperschaft:
IEEE Computer Society Staff
Format:
Elektronisch E-Book
Sprache:
Englisch
Veröffentlicht:
[Place of publication not identified] IEEE Computer Society Press 2002
Zusammenfassung:
Collects the 77 papers presented during the November 2002 symposium on the mathematical foundations of computing. Among the topics are abstract combinatorial programs and efficient property testers, a lower bound for testing 3-colorability in bounded degree graphs, a spectral algorithm for learning mixtures of distributions, and concurrent zero knowledge with logarithmic round complexity. Other topics include minimizing congestion in general networks, decoding turbo-like codes via linear programming, the parameterized complexity of counting problems, and a partition technique for overlays of envelopes. No subject index. Annotation copyrighted by Book News, Inc., Portland, OR.
Umfang:
1 online resource (xvi, 813 pages) : illustrations
Anmerkungen:
Bibliographic Level Mode of Issuance: Monograph
Anmerkungen:
English
Schlagworte:
Computer science > Congresses.
Machine theory > Congresses.
Bezugswerke: