Minimizing conjunctive queries is NP-hard, even when they are satisfiable:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
Albany, New York
1981
|
| Schriftenreihe: | State University of New York <Albany, NY> / Department of Computer Science: Technical report
1981,2 |
| Umfang: | 4 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009978124 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 950110s1981 xx |||| 00||| undod | ||
| 035 | |a (OCoLC)632689542 | ||
| 035 | |a (DE-599)BVBBV009978124 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 100 | 1 | |a Rosencrantz, Daniel J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Minimizing conjunctive queries is NP-hard, even when they are satisfiable |c Daniel J. Rosencrantz and Harry B. Hunt |
| 264 | 1 | |a Albany, New York |c 1981 | |
| 300 | |a 4 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a State University of New York <Albany, NY> / Department of Computer Science: Technical report |v 1981,2 | |
| 700 | 1 | |a Hunt, Harry B. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t State University of New York <Albany, NY> |v 1981,2 |w (DE-604)BV008905729 |9 1981,2 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006612903 | |
Datensatz im Suchindex
| _version_ | 1818952136271069184 |
|---|---|
| any_adam_object | |
| author | Rosencrantz, Daniel J. Hunt, Harry B. |
| author_facet | Rosencrantz, Daniel J. Hunt, Harry B. |
| author_role | aut aut |
| author_sort | Rosencrantz, Daniel J. |
| author_variant | d j r dj djr h b h hb hbh |
| building | Verbundindex |
| bvnumber | BV009978124 |
| ctrlnum | (OCoLC)632689542 (DE-599)BVBBV009978124 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00994nam a2200265 cb4500</leader><controlfield tag="001">BV009978124</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950110s1981 xx |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)632689542</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009978124</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rosencrantz, Daniel J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Minimizing conjunctive queries is NP-hard, even when they are satisfiable</subfield><subfield code="c">Daniel J. Rosencrantz and Harry B. Hunt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Albany, New York</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">4 Bl.</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">State University of New York <Albany, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">1981,2</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hunt, Harry B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">State University of New York <Albany, NY></subfield><subfield code="v">1981,2</subfield><subfield code="w">(DE-604)BV008905729</subfield><subfield code="9">1981,2</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006612903</subfield></datafield></record></collection> |
| id | DE-604.BV009978124 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:45:35Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006612903 |
| oclc_num | 632689542 |
| open_access_boolean | |
| physical | 4 Bl. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| record_format | marc |
| series2 | State University of New York <Albany, NY> / Department of Computer Science: Technical report |
| spelling | Rosencrantz, Daniel J. Verfasser aut Minimizing conjunctive queries is NP-hard, even when they are satisfiable Daniel J. Rosencrantz and Harry B. Hunt Albany, New York 1981 4 Bl. txt rdacontent n rdamedia nc rdacarrier State University of New York <Albany, NY> / Department of Computer Science: Technical report 1981,2 Hunt, Harry B. Verfasser aut Department of Computer Science: Technical report State University of New York <Albany, NY> 1981,2 (DE-604)BV008905729 1981,2 |
| spellingShingle | Rosencrantz, Daniel J. Hunt, Harry B. Minimizing conjunctive queries is NP-hard, even when they are satisfiable |
| title | Minimizing conjunctive queries is NP-hard, even when they are satisfiable |
| title_auth | Minimizing conjunctive queries is NP-hard, even when they are satisfiable |
| title_exact_search | Minimizing conjunctive queries is NP-hard, even when they are satisfiable |
| title_full | Minimizing conjunctive queries is NP-hard, even when they are satisfiable Daniel J. Rosencrantz and Harry B. Hunt |
| title_fullStr | Minimizing conjunctive queries is NP-hard, even when they are satisfiable Daniel J. Rosencrantz and Harry B. Hunt |
| title_full_unstemmed | Minimizing conjunctive queries is NP-hard, even when they are satisfiable Daniel J. Rosencrantz and Harry B. Hunt |
| title_short | Minimizing conjunctive queries is NP-hard, even when they are satisfiable |
| title_sort | minimizing conjunctive queries is np hard even when they are satisfiable |
| volume_link | (DE-604)BV008905729 |
| work_keys_str_mv | AT rosencrantzdanielj minimizingconjunctivequeriesisnphardevenwhentheyaresatisfiable AT huntharryb minimizingconjunctivequeriesisnphardevenwhentheyaresatisfiable |