The Boolean hierarchy: hardware over NP:
In this paper, we study the complexity of sets formed by boolean operations
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
724 |
| Schlagworte: | |
| Zusammenfassung: | In this paper, we study the complexity of sets formed by boolean operations We present many results about the boolean hierarchy: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Some results present new ideas and techniques. Others put previous results about NP and |
| Beschreibung: | 69 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010590235 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960130s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)14706046 | ||
| 035 | |a (DE-599)BVBBV010590235 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Cai, Jin-Yi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The Boolean hierarchy: hardware over NP |c Jin-yi Cai ; Lane Hemachandra |
| 264 | 1 | |a Ithaca, New York |c 1985 | |
| 300 | |a 69 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 724 | |
| 520 | 3 | |a In this paper, we study the complexity of sets formed by boolean operations | |
| 520 | 3 | |a We present many results about the boolean hierarchy: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Some results present new ideas and techniques. Others put previous results about NP and | |
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Graph theory | |
| 700 | 1 | |a Hemachandra, Lane |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 724 |w (DE-604)BV006185504 |9 724 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007062039 | ||
Datensatz im Suchindex
| _version_ | 1804125061128388608 |
|---|---|
| any_adam_object | |
| author | Cai, Jin-Yi Hemachandra, Lane |
| author_facet | Cai, Jin-Yi Hemachandra, Lane |
| author_role | aut aut |
| author_sort | Cai, Jin-Yi |
| author_variant | j y c jyc l h lh |
| building | Verbundindex |
| bvnumber | BV010590235 |
| ctrlnum | (OCoLC)14706046 (DE-599)BVBBV010590235 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01436nam a2200325 cb4500</leader><controlfield tag="001">BV010590235</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960130s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14706046</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010590235</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="100" ind1="1" ind2=" "><subfield code="a">Cai, Jin-Yi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Boolean hierarchy: hardware over NP</subfield><subfield code="c">Jin-yi Cai ; Lane Hemachandra</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">69 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">724</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In this paper, we study the complexity of sets formed by boolean operations</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We present many results about the boolean hierarchy: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Some results present new ideas and techniques. Others put previous results about NP and</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hemachandra, Lane</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">Cornell University <Ithaca, NY></subfield><subfield code="v">724</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">724</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007062039</subfield></datafield></record></collection> |
| id | DE-604.BV010590235 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:34Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007062039 |
| oclc_num | 14706046 |
| open_access_boolean | |
| physical | 69 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Cai, Jin-Yi Verfasser aut The Boolean hierarchy: hardware over NP Jin-yi Cai ; Lane Hemachandra Ithaca, New York 1985 69 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 724 In this paper, we study the complexity of sets formed by boolean operations We present many results about the boolean hierarchy: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Some results present new ideas and techniques. Others put previous results about NP and Algebra, Boolean Computational complexity Graph theory Hemachandra, Lane Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 724 (DE-604)BV006185504 724 |
| spellingShingle | Cai, Jin-Yi Hemachandra, Lane The Boolean hierarchy: hardware over NP Algebra, Boolean Computational complexity Graph theory |
| title | The Boolean hierarchy: hardware over NP |
| title_auth | The Boolean hierarchy: hardware over NP |
| title_exact_search | The Boolean hierarchy: hardware over NP |
| title_full | The Boolean hierarchy: hardware over NP Jin-yi Cai ; Lane Hemachandra |
| title_fullStr | The Boolean hierarchy: hardware over NP Jin-yi Cai ; Lane Hemachandra |
| title_full_unstemmed | The Boolean hierarchy: hardware over NP Jin-yi Cai ; Lane Hemachandra |
| title_short | The Boolean hierarchy: hardware over NP |
| title_sort | the boolean hierarchy hardware over np |
| topic | Algebra, Boolean Computational complexity Graph theory |
| topic_facet | Algebra, Boolean Computational complexity Graph theory |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT caijinyi thebooleanhierarchyhardwareovernp AT hemachandralane thebooleanhierarchyhardwareovernp |