BiblioVault - Books about Computational complexity

Results by Title

3 books about Computational complexity

	Logic and Automata: History and Perspectives Edited by Jörg Flum, Erich Grädel, and Thomas Wilke Amsterdam University Press, 2008 Library of Congress QA267.L624 2008 \| Dewey Decimal 340349 Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d’horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field. Expand Description
	Perspectives in Computation Robert Geroch University of Chicago Press, 2009 Library of Congress QA267.7.G47 2009 \| Dewey Decimal 511.352 Computation is the process of applying a procedure or algorithm to the solution of a mathematical problem. Mathematicians and physicists have been occupied for many decades pondering which problems can be solved by which procedures, and, for those that can be solved, how this can most efficiently be done. In recent years, quantum mechanics has augmented our understanding of the process of computation and of its limitations. Perspectives in Computation covers three broad topics: the computation process and its limitations, the search for computational efficiency, and the role of quantum mechanics in computation. The emphasis is theoretical; Robert Geroch asks what can be done, and what, in principle, are the limitations on what can be done? Geroch guides readers through these topics by combining general discussions of broader issues with precise mathematical formulations—as well as through examples of how computation works. Requiring little technical knowledge of mathematics or physics, Perspectives in Computation will serve both advanced undergraduates and graduate students in mathematics and physics, as well as other scientists working in adjacent fields. Expand Description
	Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparision David Sankoff and Joseph Kruskal CSLI, 2001 Library of Congress QA292.T55 1999 \| Dewey Decimal 515.24 Time Warps, String Edits and Macromolecules is a young classic in computational science. The computational perspective is that of sequence processing, in particular the problem of recognizing related sequences. The book is the first, and still best compilation of papers explaining how to measure distance between sequences, and how to compute that measure effectively. This is called string distance, Levenshtein distance, or edit distance. The book contains lucid explanations of the basic techniques; well-annotated examples of applications; mathematical analysis of its computational (algorithmic) complexity; and extensive discussion of the variants needed for weighted measures, timed sequences (songs), applications to continuous data, comparison of multiple sequences and extensions to tree-structures. This theory finds applications in molecular biology, speech recognition, analysis of bird song and error correcting in computer software. Expand Description

READERS
Browse our collection.

PUBLISHERS
See BiblioVault's publisher services.

STUDENT SERVICES
Files for college accessibility offices.

More to explore...
Recently published by academic presses

3 books about Computational complexity

Logic and Automata

History and Perspectives

Edited by Jörg Flum, Erich Grädel, and Thomas Wilke

Amsterdam University Press, 2008

Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d’horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field.

Perspectives in Computation

University of Chicago Press, 2009

Computation is the process of applying a procedure or algorithm to the solution of a mathematical problem. Mathematicians and physicists have been occupied for many decades pondering which problems can be solved by which procedures, and, for those that can be solved, how this can most efficiently be done. In recent years, quantum mechanics has augmented our understanding of the process of computation and of its limitations.

Perspectives in Computation covers three broad topics: the computation process and its limitations, the search for computational efficiency, and the role of quantum mechanics in computation. The emphasis is theoretical; Robert Geroch asks what can be done, and what, in principle, are the limitations on what can be done? Geroch guides readers through these topics by combining general discussions of broader issues with precise mathematical formulations—as well as through examples of how computation works.

Requiring little technical knowledge of mathematics or physics, Perspectives in Computation will serve both advanced undergraduates and graduate students in mathematics and physics, as well as other scientists working in adjacent fields.

Time Warps, String Edits, and Macromolecules

The Theory and Practice of Sequence Comparision

David Sankoff and Joseph Kruskal

Time Warps, String Edits and Macromolecules is a young classic in computational science. The computational perspective is that of sequence processing, in particular the problem of recognizing related sequences. The book is the first, and still best compilation of papers explaining how to measure distance between sequences, and how to compute that measure effectively. This is called string distance, Levenshtein distance, or edit distance. The book contains lucid explanations of the basic techniques; well-annotated examples of applications; mathematical analysis of its computational (algorithmic) complexity; and extensive discussion of the variants needed for weighted measures, timed sequences (songs), applications to continuous data, comparison of multiple sequences and extensions to tree-structures. This theory finds applications in molecular biology, speech recognition, analysis of bird song and error correcting in computer software.