Jump to ContentJump to Main Navigation

You are looking at 1-2 of 2 items

  • Keywords: computational complexity theory x
Clear All Modify Search

View:

PRELIMINARIES AND AGREEMENTS

Rolf Niedermeier

in Invitation to Fixed-Parameter Algorithms

Published in print:
2006
Published Online:
September 2007
ISBN:
9780198566076
eISBN:
9780191713910
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/acprof:oso/9780198566076.003.0002
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

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 ... More


The Basics

Cristopher Moore and Stephan Mertens

in The Nature of Computation

Published in print:
2011
Published Online:
December 2013
ISBN:
9780199233212
eISBN:
9780191775079
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/acprof:oso/9780199233212.003.0002
Subject:
Physics, Theoretical, Computational, and Statistical Physics

This chapter discusses the complexity of a problem by thinking about the best possible algorithm, or computer program, that solves it. It shows that computational complexity theory is not about how ... More


View: