Computational complexity; proceedings.0769523641 Computational complexity computational complexity Inherent cost of solving a problem in large-scale scientific computation, measured by the number of operations required as well as the amount of memory used and the order in which it is used. ; proceedings. IEEE (Institute of Electrical and Electronics Engineers, New York, www.ieee.org) A membership organization that includes engineers, scientists and students in electronics and allied fields. Annual Conference on Computational Complexity (20th: 2005: San Jose San Jose, city, United States San Jose (sănəzā`, săn hōzā`), city (1990 pop. 782,248), seat of Santa Clara co., W central Calif.; founded 1777, inc. 1850. , CA) Computer Society Press 2005 355 pages $190.00 Paperback QA402 This volume consists of 30 papers from the June 2005 conference on methods developed by computer scientists for studying the performance and limitations of computer algorithms. The winners of the best paper awards examine pseudorandomness for approximate counting and sampling, and time lower bounds for SAT and related problems. Other topics include monotone mon·o·tone n. 1. A succession of sounds or words uttered in a single tone of voice. 2. Music a. A single tone repeated with different words or time values, especially in a rendering of a liturgical text. circuits for weighted threshold functions, tolerant versus intolerant testing for Boolean properties, a geometric approach to private information retrieval In cryptography, a private information retrieval (PIR) protocol allows a user to retrieve an item from a server in possession of a database without revealing which item she is retrieving. , the complexity of succinct zero-sum games, and the hardness of distinguishing mixed-state quantum computations. No subject index is provided. ([c] 2005 Book News, Inc., Portland, OR) |
|
||||||||||||||||
Printer friendly
Cite/link
Email
Feedback
Reader Opinion