Free shipping over $79 | Order by Dec 31 and enjoy a $10 voucher on your next purchase
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Parameterized Complexity - Rodney G. Downey

Parameterized Complexity

By: Rodney G. Downey, M. R. Fellows

eText | 6 December 2012

At a Glance

eText

$399.00

or 4 interest-free payments of $99.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
The idea for this book was conceived over the second bottle of Villa Maria's Caber­ net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame­ terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now seem so obvious), we turned to our tattered copies of Garey and Johnson's work [239]. We were stunned to find that virtually none of the classical reductions worked in the parameterized setting. We then wondered if we'd be able to find any interesting reductions. Several years, many more bottles, so many papers, and reductions later it [3] seemed that we had unwittingly stumbled upon what we believe is a truly central and new area of complexity theory. It seemed to us that the material would be of great interest to people working in areas where exact algorithms for a small range of parameters are natural and useful (e. g. , Molecular Biology, VLSI design). The tractability theory was rich with distinctive and powerful techniques. The intractability theory seemed to have a deep structure and techniques all of its own.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionComputing & I.T.Computer ScienceMathematicsMathematical FoundationMathematical LogicApplied MathematicsCombinatorics & Graph TheoryComputer Programming & Software DevelopmentAlgorithms & Data Structures

Other Editions and Formats

Paperback

Published: 8th October 2012

View Product

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

Amazon.com

Get Big Fast

eBook

$22.99

AI-Powered Search - Trey Grainger

eBOOK

AI-Powered Search

eBook

$52.99

Tissue Proteomics : Methods and Protocols - Taufika Islam Williams

eBOOK

Tissue Proteomics

Methods and Protocols

eBook

RRP $369.00

$332.99

10%
OFF

This product is categorised by