The computational complexity of equivalence and isomorphism problems /

Saved in:
Bibliographic Details
Author / Creator:Thierauf, Thomas.
Imprint:Berlin ; New York : Springer, ©2000.
Description:1 online resource (viii, 135 pages).
Language:English
Series:Lecture notes in computer science, 0302-9743 ; 1852
Lecture notes in computer science ; 1852.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11064785
Hidden Bibliographic Details
ISBN:9783540453031
3540453032
3540410325
9783540410324
Digital file characteristics:text file PDF
Notes:Includes bibliographical references (pages 121-130) and index.
English.
Print version record.
Summary:A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain problems with respect to that model. The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits, and various kinds of branching programs are considered.
Other form:Print version:Thierauf, Thomas. Computational complexity of equivalence and isomorphism problems. Berlin ; New York : Springer, ©2000 3540410325
Standard no.:10.1007/3-540-45303-2

MARC

LEADER 00000cam a2200000Ia 4500
001 11064785
005 20170630044741.8
006 m fo d
007 cr mnummmmuuuu
008 020131s2000 gw a fob 001 0 eng d
003 ICU
040 |a EYM  |b eng  |e pn  |c EYM  |d OCLCQ  |d OCL  |d NTE  |d COO  |d YNG  |d DKDLA  |d OCLCQ  |d OCLCO  |d OCLCQ  |d GW5XE  |d OCLCF  |d OCLCQ  |d UA@  |d OCLCQ  |d YDX  |d LIP 
019 |a 436620574  |a 729891773  |a 769235376  |a 874664900  |a 990539657 
020 |a 9783540453031  |q (electronic bk.) 
020 |a 3540453032  |q (electronic bk.) 
020 |z 3540410325 
020 |z 9783540410324 
024 7 |a 10.1007/3-540-45303-2  |2 doi 
035 |a (OCoLC)48910584  |z (OCoLC)436620574  |z (OCoLC)729891773  |z (OCoLC)769235376  |z (OCoLC)874664900  |z (OCoLC)990539657 
050 4 |a QA267.7 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
049 |a MAIN 
100 1 |a Thierauf, Thomas.  |0 http://id.loc.gov/authorities/names/nb99162850  |1 http://viaf.org/viaf/17879530 
245 1 4 |a The computational complexity of equivalence and isomorphism problems /  |c Thomas Thierauf. 
260 |a Berlin ;  |a New York :  |b Springer,  |c ©2000. 
300 |a 1 online resource (viii, 135 pages). 
336 |a text  |b txt  |2 rdacontent  |0 http://id.loc.gov/vocabulary/contentTypes/txt 
337 |a computer  |b c  |2 rdamedia  |0 http://id.loc.gov/vocabulary/mediaTypes/c 
338 |a online resource  |b cr  |2 rdacarrier  |0 http://id.loc.gov/vocabulary/carriers/cr 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture notes in computer science,  |x 0302-9743 ;  |v 1852 
504 |a Includes bibliographical references (pages 121-130) and index. 
588 0 |a Print version record. 
520 |a A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain problems with respect to that model. The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits, and various kinds of branching programs are considered. 
505 0 |a Preliminaries -- Boolean Formulas and Circuits -- Branching Programs. 
546 |a English. 
650 0 |a Computational complexity  |x Data processing. 
650 0 |a Isomorphisms (Mathematics)  |x Data processing. 
650 7 |a Computational complexity  |x Data processing.  |2 fast  |0 (OCoLC)fst00871993 
650 7 |a Isomorphisms (Mathematics)  |x Data processing.  |2 fast  |0 (OCoLC)fst00980193 
650 7 |a Algebra.  |2 hilcc 
650 7 |a Mathematics.  |2 hilcc 
650 7 |a Physical Sciences & Mathematics.  |2 hilcc 
655 4 |a Electronic books. 
776 0 8 |i Print version:Thierauf, Thomas.  |t Computational complexity of equivalence and isomorphism problems.  |d Berlin ; New York : Springer, ©2000  |z 3540410325  |w (DLC) 00703237  |w (OCoLC)44937393 
830 0 |a Lecture notes in computer science ;  |v 1852.  |x 0302-9743 
856 4 0 |u http://link.springer.com/10.1007/3-540-45303-2  |y SpringerLink 
903 |a HeVa 
929 |a eresource 
999 f f |i 5b7fd216-d8fa-5031-966e-279ce173b8c5  |s fc013c8f-4ddd-5d21-b885-25a6a6183b4e 
928 |t Library of Congress classification  |a QA267.7  |l Online  |c UC-FullText  |u http://link.springer.com/10.1007/3-540-45303-2  |z SpringerLink  |g ebooks  |i 9872699