Inhaltsangabe
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 c. Book News, Inc., Portland, OR (booknews.com)
Reseña del editor
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 c. Book News, Inc., Portland, OR (booknews.com)
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.