Tractability: Practical Approaches to Hard Problems - Image 1

£130.00

Cambridge University Press Tractability: Practical Approaches to Hard Problems

Name: Tractability: Practical Approaches to Hard Problems
Brand: Cambridge University Press
Price: 130.0 GBP
Availability: InStock

YES11780730

Languages

It has never been this cheap. We have no record of a lower price.

£130 today · cheaper than every other day in the last 3 months

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 73 days • 73 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 73 days • 1 price levels

Days at Price

Price Analysis

Most common price: £130 (73 days, 100.0%)

Price range: £130 - £130

Price levels: 1 different prices over 73 days

Description

Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike.

Product Specifications

Brand: Cambridge University Press
Model: YES11780730
Format: hardcover
ASIN: 1107025192
Category: Books > Subjects > Computing & Internet > Programming > Languages
Domain: Amazon UK
Release Date: 06 February 2014
Listed Since: 25 April 2013

Barcode

No barcode data available

Cambridge University Press Tractability: Practical Approaches to Hard Problems

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Exploring New Frontiers of Theoretical Informatics: IFIP 18th World Computer Congress TC1 3rd International Conference on Theoretical Computer Science ... and Communication Technology, 155)

An Imitation-based Approach to Modeling Homogenous Agents Societies (Computational Intelligence and Its Applications)

Kripke’s Worlds: An Introduction to Modal Logics via Tableaux (Studies in Universal Logic)

Automated Reasoning with Analytic Tableaux and Related Methods: 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25–28, 2017, ... (Lecture Notes in Computer Science, 10501)

The Strategies of Informing Technology in the 21st Century (Advances in It Standards and Standardization Research)

The Strategies of Informing Technology in the 21st Century

Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

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

Knowledge Representation Techniques: A Rough Set Approach: 202 (Studies in Fuzziness and Soft Computing, 202)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Current Trends in Theoretical Computer Science: Entering the 21st Century

Logical Thinking Process: A Systems Approach to Complex Problem Solving

Parameterized Algorithms

Computational Complexity: A Modern Approach

Network Theory and Agent-Based Modeling in Economics and Finance

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

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems (Focus (Wiley))

Proceedings of ECCS 2014: European Conference on Complex Systems (Springer Proceedings in Complexity)

The Graph Isomorphism Problem: Its Structural Complexity (Progress in Theoretical Computer Science)

Incomplete Information: Rough Set Analysis: 13 (Studies in Fuzziness and Soft Computing, 13)

Distributed Search by Constrained Agents: Algorithms, Performance, Communication (Advanced Information and Knowledge Processing)

Parameterized Algorithms

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