Items related to 2002 Foundations of Comp Science(Focs) 43rd Sym
Synopsis
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)
"synopsis" may belong to another edition of this title.
Synopsis
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 kno
"About this title" may belong to another edition of this title.
Search results for 2002 Foundations of Comp Science(Focs) 43rd Sym
Stock Image
The 43rd Annual IEEE Symposium on Foundations of Computer Science: Vancouver, Bc, Canada 16-19 November 2002 : Proceedings
Seller: medimops, Berlin, Germany
Seller rating 5 out of 5 stars
Condition: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. Seller Inventory # M00769518222-G
Quantity: 1 available