Recent Progress in the Boolean Domain:
In today's world, people are using more and more digital systems in daily life. Such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. Howev...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Newcastle upon Tyne
Cambridge Scholars Publishing
2014
|
| Ausgabe: | 1st ed |
| Schlagworte: | |
| Zusammenfassung: | In today's world, people are using more and more digital systems in daily life. Such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the cause of major problems in the process of design and realization of circuits. According to Moore's Law, the complexity of digital systems approximately doubles every 18 months. This requires comprehensive knowledge and techniques to solve very complex Boolean problems. This book summarizes the recent progress in the Boolean domain in solving such issues. Part 1 describes the most powerful approaches in solving exceptionally complex Boolean problems. It is shown how an extremely rare solution could be found in a gigantic search space of more than 10 195 (this is a number of 196 decimal digits) different color patterns. Part 2 describes new research into digital circuits that realize Boolean functions. This part contains the chapters "Design" and "Test", which present solutions to problems of power dissipation, and the testing of digital circuits using a special data structure, as well as further topics. Part 3 contributes to the scientific basis of future circuit technologies, investigating the need for completely new design methods for the atomic level of quantum computers. This section also concerns itself with circuit structures in reversible logic as the basis for quantum logic |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 online resource (458 pages) |
| ISBN: | 9781443859677 9781443856386 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043609121 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160616s2014 |||| o||u| ||||||eng d | ||
| 020 | |a 9781443859677 |9 978-1-4438-5967-7 | ||
| 020 | |a 9781443856386 |c Print |9 978-1-4438-5638-6 | ||
| 035 | |a (ZDB-30-PQE)EBC1683200 | ||
| 035 | |a (ZDB-89-EBL)EBL1683200 | ||
| 035 | |a (ZDB-38-EBR)ebr10870458 | ||
| 035 | |a (OCoLC)879026105 | ||
| 035 | |a (DE-599)BVBBV043609121 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 004.015113 | |
| 100 | 1 | |a Steinbach, Bernd |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Recent Progress in the Boolean Domain |
| 250 | |a 1st ed | ||
| 264 | 1 | |a Newcastle upon Tyne |b Cambridge Scholars Publishing |c 2014 | |
| 264 | 4 | |c © 2014 | |
| 300 | |a 1 online resource (458 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 520 | |a In today's world, people are using more and more digital systems in daily life. Such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the cause of major problems in the process of design and realization of circuits. According to Moore's Law, the complexity of digital systems approximately doubles every 18 months. This requires comprehensive knowledge and techniques to solve very complex Boolean problems. This book summarizes the recent progress in the Boolean domain in solving such issues. Part 1 describes the most powerful approaches in solving exceptionally complex Boolean problems. It is shown how an extremely rare solution could be found in a gigantic search space of more than 10 195 (this is a number of 196 decimal digits) different color patterns. Part 2 describes new research into digital circuits that realize Boolean functions. This part contains the chapters "Design" and "Test", which present solutions to problems of power dissipation, and the testing of digital circuits using a special data structure, as well as further topics. Part 3 contributes to the scientific basis of future circuit technologies, investigating the need for completely new design methods for the atomic level of quantum computers. This section also concerns itself with circuit structures in reversible logic as the basis for quantum logic | ||
| 650 | 4 | |a Automatic theorem proving -- Congresses | |
| 650 | 4 | |a Logic, Symbolic and mathematical -- Congresses | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Steinbach, Bernd |t Recent Progress in the Boolean Domain |
| 912 | |a ZDB-30-PQE | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029023180 | ||
Datensatz im Suchindex
| _version_ | 1804176355448848384 |
|---|---|
| any_adam_object | |
| author | Steinbach, Bernd |
| author_facet | Steinbach, Bernd |
| author_role | aut |
| author_sort | Steinbach, Bernd |
| author_variant | b s bs |
| building | Verbundindex |
| bvnumber | BV043609121 |
| collection | ZDB-30-PQE |
| ctrlnum | (ZDB-30-PQE)EBC1683200 (ZDB-89-EBL)EBL1683200 (ZDB-38-EBR)ebr10870458 (OCoLC)879026105 (DE-599)BVBBV043609121 |
| dewey-full | 004.015113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015113 |
| dewey-search | 004.015113 |
| dewey-sort | 14.015113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 1st ed |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02991nmm a2200409zc 4500</leader><controlfield tag="001">BV043609121</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160616s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781443859677</subfield><subfield code="9">978-1-4438-5967-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781443856386</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4438-5638-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC1683200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL1683200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr10870458</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)879026105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043609121</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015113</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Steinbach, Bernd</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recent Progress in the Boolean Domain</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Newcastle upon Tyne</subfield><subfield code="b">Cambridge Scholars Publishing</subfield><subfield code="c">2014</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (458 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In today's world, people are using more and more digital systems in daily life. Such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the cause of major problems in the process of design and realization of circuits. According to Moore's Law, the complexity of digital systems approximately doubles every 18 months. This requires comprehensive knowledge and techniques to solve very complex Boolean problems. This book summarizes the recent progress in the Boolean domain in solving such issues. Part 1 describes the most powerful approaches in solving exceptionally complex Boolean problems. It is shown how an extremely rare solution could be found in a gigantic search space of more than 10 195 (this is a number of 196 decimal digits) different color patterns. Part 2 describes new research into digital circuits that realize Boolean functions. This part contains the chapters "Design" and "Test", which present solutions to problems of power dissipation, and the testing of digital circuits using a special data structure, as well as further topics. Part 3 contributes to the scientific basis of future circuit technologies, investigating the need for completely new design methods for the atomic level of quantum computers. This section also concerns itself with circuit structures in reversible logic as the basis for quantum logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving -- Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical -- Congresses</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Steinbach, Bernd</subfield><subfield code="t">Recent Progress in the Boolean Domain</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029023180</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV043609121 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:30:52Z |
| institution | BVB |
| isbn | 9781443859677 9781443856386 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029023180 |
| oclc_num | 879026105 |
| open_access_boolean | |
| physical | 1 online resource (458 pages) |
| psigel | ZDB-30-PQE |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Cambridge Scholars Publishing |
| record_format | marc |
| spelling | Steinbach, Bernd Verfasser aut Recent Progress in the Boolean Domain 1st ed Newcastle upon Tyne Cambridge Scholars Publishing 2014 © 2014 1 online resource (458 pages) txt rdacontent c rdamedia cr rdacarrier Description based on publisher supplied metadata and other sources In today's world, people are using more and more digital systems in daily life. Such systems utilize the elementariness of Boolean values. A Boolean variable can carry only two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the cause of major problems in the process of design and realization of circuits. According to Moore's Law, the complexity of digital systems approximately doubles every 18 months. This requires comprehensive knowledge and techniques to solve very complex Boolean problems. This book summarizes the recent progress in the Boolean domain in solving such issues. Part 1 describes the most powerful approaches in solving exceptionally complex Boolean problems. It is shown how an extremely rare solution could be found in a gigantic search space of more than 10 195 (this is a number of 196 decimal digits) different color patterns. Part 2 describes new research into digital circuits that realize Boolean functions. This part contains the chapters "Design" and "Test", which present solutions to problems of power dissipation, and the testing of digital circuits using a special data structure, as well as further topics. Part 3 contributes to the scientific basis of future circuit technologies, investigating the need for completely new design methods for the atomic level of quantum computers. This section also concerns itself with circuit structures in reversible logic as the basis for quantum logic Automatic theorem proving -- Congresses Logic, Symbolic and mathematical -- Congresses (DE-588)1071861417 Konferenzschrift gnd-content Erscheint auch als Druck-Ausgabe Steinbach, Bernd Recent Progress in the Boolean Domain |
| spellingShingle | Steinbach, Bernd Recent Progress in the Boolean Domain Automatic theorem proving -- Congresses Logic, Symbolic and mathematical -- Congresses |
| subject_GND | (DE-588)1071861417 |
| title | Recent Progress in the Boolean Domain |
| title_auth | Recent Progress in the Boolean Domain |
| title_exact_search | Recent Progress in the Boolean Domain |
| title_full | Recent Progress in the Boolean Domain |
| title_fullStr | Recent Progress in the Boolean Domain |
| title_full_unstemmed | Recent Progress in the Boolean Domain |
| title_short | Recent Progress in the Boolean Domain |
| title_sort | recent progress in the boolean domain |
| topic | Automatic theorem proving -- Congresses Logic, Symbolic and mathematical -- Congresses |
| topic_facet | Automatic theorem proving -- Congresses Logic, Symbolic and mathematical -- Congresses Konferenzschrift |
| work_keys_str_mv | AT steinbachbernd recentprogressinthebooleandomain |