Applied satisfiability: cryptography, scheduling and coalitional games
Apply satisfiability to a range of difficult problems The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Hoboken
Wiley
2025
|
| Subjects: | |
| Links: | https://learning.oreilly.com/library/view/-/9781394249787/?ar |
| Summary: | Apply satisfiability to a range of difficult problems The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT and weighted MaxSAT, which assess whether, and to what extent, a solution satisfies a given set of problems. Numerous applications of SAT and MaxSAT have emerged in fields related to logic and computing technology. Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games outlines some of these applications in three specific fields. It offers a huge range of SAT applications and their possible impacts, allowing readers to tackle previously challenging optimization problems with a new selection of tools. Professionals and researchers in this field will find the scope of their computational solutions to otherwise intractable problems vastly increased. Applied Satisfiability readers will also find: Coding and problem-solving skills applicable to a variety of fields Specific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methods Chapters covering topics including cryptographic key recovery, various forms of scheduling, coalition structure generation, and many more Applied Satisfiability is ideal for researchers, graduate students, and practitioners in these fields looking to bring a new skillset to bear in their studies and careers. |
| Item Description: | Includes bibliographical references and index |
| Physical Description: | 1 Online-Ressource |
| ISBN: | 9781394249817 1394249810 9781394249800 1394249802 9781394249787 |
Staff View
MARC
| LEADER | 00000nam a22000002c 4500 | ||
|---|---|---|---|
| 001 | ZDB-30-ORH-112912435 | ||
| 003 | DE-627-1 | ||
| 005 | 20250306143524.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 250306s2025 xx |||||o 00| ||eng c | ||
| 020 | |a 9781394249817 |c electronic bk. : oBook |9 978-1-394-24981-7 | ||
| 020 | |a 1394249810 |c electronic bk. : oBook |9 1-394-24981-0 | ||
| 020 | |a 9781394249800 |c electronic bk. |9 978-1-394-24980-0 | ||
| 020 | |a 1394249802 |c electronic bk. |9 1-394-24980-2 | ||
| 020 | |a 9781394249787 |9 978-1-394-24978-7 | ||
| 035 | |a (DE-627-1)112912435 | ||
| 035 | |a (DE-599)KEP112912435 | ||
| 035 | |a (ORHE)9781394249787 | ||
| 035 | |a (DE-627-1)112912435 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 082 | 0 | |a 006.3 |2 23/eng/20250204 | |
| 100 | 1 | |a Liao, Xiaojuan |e VerfasserIn |4 aut | |
| 245 | 1 | 0 | |a Applied satisfiability |b cryptography, scheduling and coalitional games |c Xiaojuan Liao, Miyuki Koshimura |
| 264 | 1 | |a Hoboken |b Wiley |c 2025 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 520 | |a Apply satisfiability to a range of difficult problems The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT and weighted MaxSAT, which assess whether, and to what extent, a solution satisfies a given set of problems. Numerous applications of SAT and MaxSAT have emerged in fields related to logic and computing technology. Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games outlines some of these applications in three specific fields. It offers a huge range of SAT applications and their possible impacts, allowing readers to tackle previously challenging optimization problems with a new selection of tools. Professionals and researchers in this field will find the scope of their computational solutions to otherwise intractable problems vastly increased. Applied Satisfiability readers will also find: Coding and problem-solving skills applicable to a variety of fields Specific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methods Chapters covering topics including cryptographic key recovery, various forms of scheduling, coalition structure generation, and many more Applied Satisfiability is ideal for researchers, graduate students, and practitioners in these fields looking to bring a new skillset to bear in their studies and careers. | ||
| 650 | 0 | |a Boolean logic | |
| 650 | 0 | |a Data encryption (Computer science) | |
| 650 | 0 | |a Program transformation (Computer programming) | |
| 650 | 4 | |a Chiffrement (Informatique) | |
| 650 | 4 | |a Transformation de programme (Informatique) | |
| 700 | 1 | |a Koshimura, Miyuki |e MitwirkendeR |4 ctb | |
| 776 | 1 | |z 1394249780 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 1394249780 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781394249787/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-ORH | ||
| 951 | |a BO | ||
| 912 | |a ZDB-30-ORH | ||
| 049 | |a DE-91 | ||
Record in the Search Index
| DE-BY-TUM_katkey | ZDB-30-ORH-112912435 |
|---|---|
| _version_ | 1829007828738637824 |
| adam_text | |
| any_adam_object | |
| author | Liao, Xiaojuan |
| author2 | Koshimura, Miyuki |
| author2_role | ctb |
| author2_variant | m k mk |
| author_facet | Liao, Xiaojuan Koshimura, Miyuki |
| author_role | aut |
| author_sort | Liao, Xiaojuan |
| author_variant | x l xl |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-30-ORH |
| ctrlnum | (DE-627-1)112912435 (DE-599)KEP112912435 (ORHE)9781394249787 |
| dewey-full | 006.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 |
| dewey-search | 006.3 |
| dewey-sort | 16.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03234nam a22004692c 4500</leader><controlfield tag="001">ZDB-30-ORH-112912435</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20250306143524.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">250306s2025 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781394249817</subfield><subfield code="c">electronic bk. : oBook</subfield><subfield code="9">978-1-394-24981-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1394249810</subfield><subfield code="c">electronic bk. : oBook</subfield><subfield code="9">1-394-24981-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781394249800</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-394-24980-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1394249802</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-394-24980-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781394249787</subfield><subfield code="9">978-1-394-24978-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)112912435</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP112912435</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781394249787</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)112912435</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">23/eng/20250204</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Liao, Xiaojuan</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Applied satisfiability</subfield><subfield code="b">cryptography, scheduling and coalitional games</subfield><subfield code="c">Xiaojuan Liao, Miyuki Koshimura</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken</subfield><subfield code="b">Wiley</subfield><subfield code="c">2025</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Apply satisfiability to a range of difficult problems The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT and weighted MaxSAT, which assess whether, and to what extent, a solution satisfies a given set of problems. Numerous applications of SAT and MaxSAT have emerged in fields related to logic and computing technology. Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games outlines some of these applications in three specific fields. It offers a huge range of SAT applications and their possible impacts, allowing readers to tackle previously challenging optimization problems with a new selection of tools. Professionals and researchers in this field will find the scope of their computational solutions to otherwise intractable problems vastly increased. Applied Satisfiability readers will also find: Coding and problem-solving skills applicable to a variety of fields Specific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methods Chapters covering topics including cryptographic key recovery, various forms of scheduling, coalition structure generation, and many more Applied Satisfiability is ideal for researchers, graduate students, and practitioners in these fields looking to bring a new skillset to bear in their studies and careers.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Boolean logic</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data encryption (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Program transformation (Computer programming)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chiffrement (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transformation de programme (Informatique)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Koshimura, Miyuki</subfield><subfield code="e">MitwirkendeR</subfield><subfield code="4">ctb</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">1394249780</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">1394249780</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781394249787/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-30-ORH-112912435 |
| illustrated | Not Illustrated |
| indexdate | 2025-04-10T09:36:30Z |
| institution | BVB |
| isbn | 9781394249817 1394249810 9781394249800 1394249802 9781394249787 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource |
| psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
| publishDate | 2025 |
| publishDateSearch | 2025 |
| publishDateSort | 2025 |
| publisher | Wiley |
| record_format | marc |
| spelling | Liao, Xiaojuan VerfasserIn aut Applied satisfiability cryptography, scheduling and coalitional games Xiaojuan Liao, Miyuki Koshimura Hoboken Wiley 2025 1 Online-Ressource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Includes bibliographical references and index Apply satisfiability to a range of difficult problems The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT and weighted MaxSAT, which assess whether, and to what extent, a solution satisfies a given set of problems. Numerous applications of SAT and MaxSAT have emerged in fields related to logic and computing technology. Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games outlines some of these applications in three specific fields. It offers a huge range of SAT applications and their possible impacts, allowing readers to tackle previously challenging optimization problems with a new selection of tools. Professionals and researchers in this field will find the scope of their computational solutions to otherwise intractable problems vastly increased. Applied Satisfiability readers will also find: Coding and problem-solving skills applicable to a variety of fields Specific experiments and case studies that demonstrate the effectiveness of satisfiability-aided methods Chapters covering topics including cryptographic key recovery, various forms of scheduling, coalition structure generation, and many more Applied Satisfiability is ideal for researchers, graduate students, and practitioners in these fields looking to bring a new skillset to bear in their studies and careers. Boolean logic Data encryption (Computer science) Program transformation (Computer programming) Chiffrement (Informatique) Transformation de programme (Informatique) Koshimura, Miyuki MitwirkendeR ctb 1394249780 Erscheint auch als Druck-Ausgabe 1394249780 |
| spellingShingle | Liao, Xiaojuan Applied satisfiability cryptography, scheduling and coalitional games Boolean logic Data encryption (Computer science) Program transformation (Computer programming) Chiffrement (Informatique) Transformation de programme (Informatique) |
| title | Applied satisfiability cryptography, scheduling and coalitional games |
| title_auth | Applied satisfiability cryptography, scheduling and coalitional games |
| title_exact_search | Applied satisfiability cryptography, scheduling and coalitional games |
| title_full | Applied satisfiability cryptography, scheduling and coalitional games Xiaojuan Liao, Miyuki Koshimura |
| title_fullStr | Applied satisfiability cryptography, scheduling and coalitional games Xiaojuan Liao, Miyuki Koshimura |
| title_full_unstemmed | Applied satisfiability cryptography, scheduling and coalitional games Xiaojuan Liao, Miyuki Koshimura |
| title_short | Applied satisfiability |
| title_sort | applied satisfiability cryptography scheduling and coalitional games |
| title_sub | cryptography, scheduling and coalitional games |
| topic | Boolean logic Data encryption (Computer science) Program transformation (Computer programming) Chiffrement (Informatique) Transformation de programme (Informatique) |
| topic_facet | Boolean logic Data encryption (Computer science) Program transformation (Computer programming) Chiffrement (Informatique) Transformation de programme (Informatique) |
| work_keys_str_mv | AT liaoxiaojuan appliedsatisfiabilitycryptographyschedulingandcoalitionalgames AT koshimuramiyuki appliedsatisfiabilitycryptographyschedulingandcoalitionalgames |