Abstract
We assume that the reader is familiar with the basic notions that are usually taught in a course on complexity theory, linear algebra, and probability theory. In particular, for computational models such as Turing machines, boolean circuits or boolean formulas, we refer to some standard textbook as for example [BDG88, BDG91, HU79, Pap94, Sip97]. The languages or sets we consider are sets of strings or words over the fixed alphabet Σ = {0,1}. The empty string is denoted by λ. An n-any boolean function f = f(x 1,..., x n) is a mapping from {0, 1}n to {0,1}.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2000). Preliminaries. In: Thierauf, T. (eds) The Computational Complexity of Equivalence and Isomorphism Problems. Lecture Notes in Computer Science, vol 1852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45303-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-45303-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41032-4
Online ISBN: 978-3-540-45303-1
eBook Packages: Springer Book Archive