View in EDS PDF Full Text

Tractability : Practical Approaches to Hard Problems

Saved in:
Bibliographic Details
Title: Tractability : Practical Approaches to Hard Problems
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.
Authors: Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli
Resource Type: eBook.
Subjects: Parameter estimation, Computational complexity
Categories: MATHEMATICS / General
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 685234
RelevancyScore: 1057
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1057.36352539063
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$685234$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$685234$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Tractability : Practical Approaches to Hard Problems
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Lucas+Bordeaux%22">Lucas Bordeaux</searchLink><br /><searchLink fieldCode="AR" term="%22Youssef+Hamadi%22">Youssef Hamadi</searchLink><br /><searchLink fieldCode="AR" term="%22Pushmeet+Kohli%22">Pushmeet Kohli</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Parameter+estimation%22">Parameter estimation</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+General%22">MATHEMATICS / General</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=685234
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 511.3
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Parameter estimation
        Type: general
      – SubjectFull: Computational complexity
        Type: general
    Titles:
      – TitleFull: Tractability : Practical Approaches to Hard Problems
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Lucas Bordeaux
      – PersonEntity:
          Name:
            NameFull: Youssef Hamadi
      – PersonEntity:
          Name:
            NameFull: Pushmeet Kohli
      – PersonEntity:
          Name:
            NameFull: Lucas Bordeaux
      – PersonEntity:
          Name:
            NameFull: Youssef Hamadi
      – PersonEntity:
          Name:
            NameFull: Pushmeet Kohli
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2014
            – D: 20
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9781107025196
            – Type: isbn-electronic
              Value: 9781107731851
          Titles:
            – TitleFull: Tractability : Practical Approaches to Hard Problems
              Type: main
ResultId 1