Models of Query Complexity for Boolean Functions

By Sourav Chakraborty

In this thesis we study various models of query complexity. A query algorithm computes a function under the restriction that the input can be accessed only by making probes to the the bits of the... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3838392698
• ISBN13: 9783838392691
• Release Date: August 2010
• Publisher: LAP Lambert Academic Publishing
• Length: 132 Pages
• Weight: 0.45 lbs.
• Dimensions: 0.3" x 6.0" x 9.0"