Entropy, Search, Complexity: 16 (Bolyai Society Mathematical Studies, 16) - Image 1

£57.97

Springer Entropy, Search, Complexity: 16 (Bolyai Society Mathematical Studies, 16)

Name: Entropy, Search, Complexity: 16 (Bolyai Society Mathematical Studies, 16)
Brand: Springer
Price: 57.97 GBP
Availability: InStock

Managers' Guides to Computing

This is the usual price. Wait for it to drop, or tell us your number.

£58 today · usual range £0–£0 · best ever £36

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 640 days • 640 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 640 days • 8 price levels

Days at Price

Current Price

Price Analysis

Most common price: £36 (381 days, 59.5%)

Price range: £36 - £59

Price levels: 8 different prices over 640 days

Description

The present volume is a collection of survey papers in the ?elds given in the title. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The volume is slightly related to the twin conferences “Search And Communication Complexity” and “Information Theory In Mathematics” held at Balatonlelle, Hungary in 2000. These conferences led us to believe that there is a need for such a collection of papers. The paper written by Martin Aigner starts with the following relatively new search problem. Given n boolean variables as input one has to ?nd one of them whose value is in majority. The goal is to minimize the number of tests needed for this where one test is to compare two input variables for equality. The paper surveys the large set of problems and results which grew out of this one. In the traditional search model an unknown element is sought in a ?nite set, based on the information that the unknown element is or is not in some (asked) subsets. A variant is when a 0,1 function is given on the underlying set, and only the values of this function at the unknown element x is sought rather than x itself. This is called the recognition problem.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3540325735
Category: Books > Subjects > Business, Finance & Law > E-Commerce > Managers' Guides to Computing
Domain: Amazon UK
Release Date: 19 January 2007
Listed Since: 04 October 2006

Barcode

No barcode data available

Springer Entropy, Search, Complexity: 16 (Bolyai Society Mathematical Studies, 16)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Combinatorial Group Testing and Its Applications (Series on Applied Mathematics): 12

Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques

Search Methods in Artificial Intelligence

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Web Search: Multidisciplinary Perspectives: 14 (Information Science and Knowledge Management, 14)

Universal Compression and Retrieval: 274 (Mathematics and Its Applications, 274)

Concepts and Methods for a Librarian of the Web: 62 (Studies in Big Data, 62)

Concepts and Methods for a Librarian of the Web: 62 (Studies in Big Data, 62)

Rough Set and Knowledge Technology: 5th International Conference, RSKT 2010, Beijing, China, October 15-17, 2010, Proceedings: 6401 (Lecture Notes in Computer Science, 6401)

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Understanding and Improving Information Search: A Cognitive Approach (Human–Computer Interaction Series)

Understanding and Improving Information Search: A Cognitive Approach (Human–Computer Interaction Series)

Computer and Information Science 2015: 614 (Studies in Computational Intelligence, 614)

Art of Computer Programming, The, Volumes 1-4B, Boxed Set: Fundamental Algorithms / Seminumerical Algorithms / Sorting and Searching / Combinatorial ... Part 1 / Combinatorial Algorithms, Part 2

Search Theory: A Game Theoretic Perspective

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Search Theory: Some Recent Developments (Lecture Notes in Pure and Applied Mathematics)

Quality Issues in the Management of Web Information: 50 (Intelligent Systems Reference Library, 50)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Art of Computer Programming, The: Combinatorial Algorithms, Volume 4B

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)