Boolean Functions and Computation Models
Edition: 1 edition
Publisher: Springer
Published: November 11, 2002
Language: eng
Format: Hardcover
Number of pages: 615
ISBN-13: 9783540594369
Subjects: Computer Programming; Mathematical theory of computation; Parallel processing; Programming - General; Computer Science; Boolean Algebra; Theory Of Computing; Computers; Mathematics; Computer Books: General; Logic; Discrete Mathematics; Computers / Computer Science; Algebra, Boolean; Algebra - General; Computational complexity
First sentence: Many fundamental questions in complexity theory can be formulated as a language recognition problem, where by language L we understand a set of strings over a finite alphabet, say = {0, 1}.