A complexity theory for feasible closure properties:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Rochester, NY
1991
|
| Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
377 |
| Schlagworte: | |
| Beschreibung: | 36 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992625 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)26491233 | ||
| 035 | |a (DE-599)BVBBV008992625 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 100 | 1 | |a Ogiwara, Mitsunori |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A complexity theory for feasible closure properties |c Mitsunori Ogiwara ; Lane A. Hemachandra |
| 264 | 1 | |a Rochester, NY |c 1991 | |
| 300 | |a 36 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 377 | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a NP-complete problems | |
| 650 | 4 | |a Set theory | |
| 700 | 1 | |a Hemachandra, Lane A. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 377 |w (DE-604)BV008902697 |9 377 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941555 | ||
Datensatz im Suchindex
| _version_ | 1804123335099940864 |
|---|---|
| any_adam_object | |
| author | Ogiwara, Mitsunori Hemachandra, Lane A. |
| author_facet | Ogiwara, Mitsunori Hemachandra, Lane A. |
| author_role | aut aut |
| author_sort | Ogiwara, Mitsunori |
| author_variant | m o mo l a h la lah |
| building | Verbundindex |
| bvnumber | BV008992625 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)26491233 (DE-599)BVBBV008992625 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01109nam a2200325 cb4500</leader><controlfield tag="001">BV008992625</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26491233</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992625</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-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ogiwara, Mitsunori</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A complexity theory for feasible closure properties</subfield><subfield code="c">Mitsunori Ogiwara ; Lane A. Hemachandra</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">36 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 of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">377</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Set theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hemachandra, Lane A.</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">University of Rochester <Rochester, NY></subfield><subfield code="v">377</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">377</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941555</subfield></datafield></record></collection> |
| id | DE-604.BV008992625 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941555 |
| oclc_num | 26491233 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 36 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Ogiwara, Mitsunori Verfasser aut A complexity theory for feasible closure properties Mitsunori Ogiwara ; Lane A. Hemachandra Rochester, NY 1991 36 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 377 Computational complexity NP-complete problems Set theory Hemachandra, Lane A. Verfasser aut Department of Computer Science: Technical report University of Rochester <Rochester, NY> 377 (DE-604)BV008902697 377 |
| spellingShingle | Ogiwara, Mitsunori Hemachandra, Lane A. A complexity theory for feasible closure properties Computational complexity NP-complete problems Set theory |
| title | A complexity theory for feasible closure properties |
| title_auth | A complexity theory for feasible closure properties |
| title_exact_search | A complexity theory for feasible closure properties |
| title_full | A complexity theory for feasible closure properties Mitsunori Ogiwara ; Lane A. Hemachandra |
| title_fullStr | A complexity theory for feasible closure properties Mitsunori Ogiwara ; Lane A. Hemachandra |
| title_full_unstemmed | A complexity theory for feasible closure properties Mitsunori Ogiwara ; Lane A. Hemachandra |
| title_short | A complexity theory for feasible closure properties |
| title_sort | a complexity theory for feasible closure properties |
| topic | Computational complexity NP-complete problems Set theory |
| topic_facet | Computational complexity NP-complete problems Set theory |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT ogiwaramitsunori acomplexitytheoryforfeasibleclosureproperties AT hemachandralanea acomplexitytheoryforfeasibleclosureproperties |