Easy problems are sometimes hard
Abstract: "We present a detailed experimental investigation of the phase transition from satisfiable to unsatisfiable for randomly generated instances of SAT problems. This study demonstrates that problems in classes previously thought to be 'easy' can sometimes be orders of magnitude...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1993
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
642 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010464615 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 951107s1993 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)31223357 | ||
| 035 | |a (DE-599)BVBBV010464615 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA76.952 | |
| 100 | 1 | |a Gent, Ian P. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Easy problems are sometimes hard |c Ian P. Gent and Toby Walsh |
| 264 | 1 | |a Edinburgh |c 1993 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 642 | |
| 520 | 3 | |a Abstract: "We present a detailed experimental investigation of the phase transition from satisfiable to unsatisfiable for randomly generated instances of SAT problems. This study demonstrates that problems in classes previously thought to be 'easy' can sometimes be orders of magnitude more difficult than the worst problems in classes considered 'hard'. This result explains the large variability in problem difficulty observed in these 'easy' classes. We present evidence which suggests that this phenomenon cannot be eliminated by the use of better heuristics. These difficult problems appear to be fundamentally hard or to contain subproblems that are fundamentally hard." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a NP-complete problems | |
| 700 | 1 | |a Walsh, Toby |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 642 |w (DE-604)BV010450646 |9 642 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006972874 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6034 |
|---|---|
| DE-BY-TUM_katkey | 664284 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010051577 |
| _version_ | 1820855181941669888 |
| any_adam_object | |
| author | Gent, Ian P. Walsh, Toby |
| author_facet | Gent, Ian P. Walsh, Toby |
| author_role | aut aut |
| author_sort | Gent, Ian P. |
| author_variant | i p g ip ipg t w tw |
| building | Verbundindex |
| bvnumber | BV010464615 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.952 |
| callnumber-search | QA76.952 |
| callnumber-sort | QA 276.952 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)31223357 (DE-599)BVBBV010464615 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01830nam a2200361 cb4500</leader><controlfield tag="001">BV010464615</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">951107s1993 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31223357</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010464615</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.952</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gent, Ian P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Easy problems are sometimes hard</subfield><subfield code="c">Ian P. Gent and Toby Walsh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">642</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a detailed experimental investigation of the phase transition from satisfiable to unsatisfiable for randomly generated instances of SAT problems. This study demonstrates that problems in classes previously thought to be 'easy' can sometimes be orders of magnitude more difficult than the worst problems in classes considered 'hard'. This result explains the large variability in problem difficulty observed in these 'easy' classes. We present evidence which suggests that this phenomenon cannot be eliminated by the use of better heuristics. These difficult problems appear to be fundamentally hard or to contain subproblems that are fundamentally hard."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Walsh, Toby</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">642</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">642</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006972874</subfield></datafield></record></collection> |
| id | DE-604.BV010464615 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-23T13:59:41Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006972874 |
| oclc_num | 31223357 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spellingShingle | Gent, Ian P. Walsh, Toby Easy problems are sometimes hard Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik NP-complete problems |
| title | Easy problems are sometimes hard |
| title_auth | Easy problems are sometimes hard |
| title_exact_search | Easy problems are sometimes hard |
| title_full | Easy problems are sometimes hard Ian P. Gent and Toby Walsh |
| title_fullStr | Easy problems are sometimes hard Ian P. Gent and Toby Walsh |
| title_full_unstemmed | Easy problems are sometimes hard Ian P. Gent and Toby Walsh |
| title_short | Easy problems are sometimes hard |
| title_sort | easy problems are sometimes hard |
| topic | Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik NP-complete problems |
| topic_facet | Bionics and artificial intelligence Computer software Mathematics Mathematik NP-complete problems |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT gentianp easyproblemsaresometimeshard AT walshtoby easyproblemsaresometimeshard |