Jump to ContentJump to Main Navigation
Invitation to Fixed-Parameter Algorithms$
Users without a subscription are not able to see the full content.

Rolf Niedermeier

Print publication date: 2006

Print ISBN-13: 9780198566076

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198566076.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see http://www.oxfordscholarship.com/page/privacy-policy).date: 21 February 2018

PRELIMINARIES AND AGREEMENTS

PRELIMINARIES AND AGREEMENTS

Chapter:
(p.17) 2 PRELIMINARIES AND AGREEMENTS
Source:
Invitation to Fixed-Parameter Algorithms
Author(s):

Rolf Niedermeier

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198566076.003.0002

This chapter introduces the basic mathematical formalism and discusses concepts used throughout the book. Among other things, it looks at decision problems vs optimization problems, Random Access Machines, big Oh notation, strings and graphs. It concludes by looking at the basics from computational complexity theory.

Keywords:   decision problem, optimization problem, strings, graphs, computational complexity theory, Random Access Machines, big Oh notation

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .