|
|
|
|
| LEADER |
02664nam a2200505 4500 |
| 001 |
978-3-540-45303-1 |
| 003 |
DE-He213 |
| 005 |
20191022112435.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2000 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540453031
|9 978-3-540-45303-1
|
| 024 |
7 |
|
|a 10.1007/3-540-45303-2
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 050 |
|
4 |
|a QA76.63
|
| 072 |
|
7 |
|a UY
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UY
|2 thema
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 100 |
1 |
|
|a Thierauf, Thomas.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
4 |
|a The Computational Complexity of Equivalence and Isomorphism Problems
|h [electronic resource] /
|c by Thomas Thierauf.
|
| 250 |
|
|
|a 1st ed. 2000.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2000.
|
| 300 |
|
|
|a VIII, 135 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1852
|
| 505 |
0 |
|
|a Preliminaries -- Boolean Formulas and Circuits -- Branching Programs.
|
| 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.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|0 http://scigraph.springernature.com/things/product-market-codes/I16005
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|0 http://scigraph.springernature.com/things/product-market-codes/I16013
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783662214626
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540410324
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1852
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45303-2
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
