An Introduction to Online Computation: Determinism, Randomization, Advice (Texts in Theoretical Computer Science. An EATCS Series) - Image 1

£65.02

Springer An Introduction to Online Computation: Determinism, Randomization, Advice (Texts in Theoretical Computer Science. An EATCS Series)

Name: An Introduction to Online Computation: Determinism, Randomization, Advice (Texts in Theoretical Computer Science. An EATCS Series)
Brand: Springer
Price: 64.91 GBP
Availability: InStock

Architecture & Microprocessors

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 40 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £65 (23 days, 57.5%)

Price range: £65 - £69

Price levels: 2 different prices over 40 days

Description

This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3319427474
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 10 November 2016
Listed Since: 10 June 2016

Barcode

No barcode data available

Springer An Introduction to Online Computation: Determinism, Randomization, Advice (Texts in Theoretical Computer Science. An EATCS Series)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Online Computation Compet Analysis

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Theory of Computation (Texts in Computer Science)

Online Algorithms: The State of the Art: 1442 (Lecture Notes in Computer Science, 1442)

Time-Dependent Scheduling (Monographs in Theoretical Computer Science. An EATCS Series)

Online Algorithms

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Computational Complexity: A Conceptual Perspective

Optimization Theory

Computational Complexity: A Modern Approach

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

The Nature of Computation

An Introduction To The Analysis Of Algorithms (3rd Edition)

Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Springer Graphs and Algorithms in Communication Networks Book

Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks (Texts in Theoretical Computer Science. An EATCS Series)

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

The Theory of Hash Functions and Random Oracles: An Approach to Modern Cryptography (Information Security and Cryptography)

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

A Guide to Graph Colouring: Algorithms and Applications

Distributed Computing Through Combinatorial Topology