Simultaneous strong separations of probabilistic and unambiguous complexity classes:
Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune....
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Rochester, NY
1990
|
| Series: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
335 |
| Subjects: | |
| Summary: | Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune. We answer questions formulated in -- and extend the line of research opened by -- Geske and Grollman [15] and Balcázar and Russo [3]." |
| Physical Description: | 18 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008950533 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24875188 | ||
| 035 | |a (DE-599)BVBBV008950533 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 245 | 1 | 0 | |a Simultaneous strong separations of probabilistic and unambiguous complexity classes |c David Eppstein ... |
| 264 | 1 | |a Rochester, NY |c 1990 | |
| 300 | |a 18 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 335 | |
| 520 | 3 | |a Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune. We answer questions formulated in -- and extend the line of research opened by -- Geske and Grollman [15] and Balcázar and Russo [3]." | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Probabilities | |
| 700 | 1 | |a Eppstein, David |e Sonstige |4 oth | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 335 |w (DE-604)BV008902697 |9 335 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005906096 | ||
Record in the Search Index
| _version_ | 1804123283937820672 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV008950533 |
| ctrlnum | (OCoLC)24875188 (DE-599)BVBBV008950533 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01452nam a2200301 cb4500</leader><controlfield tag="001">BV008950533</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24875188</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008950533</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="245" ind1="1" ind2="0"><subfield code="a">Simultaneous strong separations of probabilistic and unambiguous complexity classes</subfield><subfield code="c">David Eppstein ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 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">335</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune. We answer questions formulated in -- and extend the line of research opened by -- Geske and Grollman [15] and Balcázar and Russo [3]."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probabilities</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Eppstein, David</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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">335</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">335</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005906096</subfield></datafield></record></collection> |
| id | DE-604.BV008950533 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005906096 |
| oclc_num | 24875188 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 18 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Simultaneous strong separations of probabilistic and unambiguous complexity classes David Eppstein ... Rochester, NY 1990 18 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 335 Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune. We answer questions formulated in -- and extend the line of research opened by -- Geske and Grollman [15] and Balcázar and Russo [3]." Computational complexity Probabilities Eppstein, David Sonstige oth Department of Computer Science: Technical report University of Rochester <Rochester, NY> 335 (DE-604)BV008902697 335 |
| spellingShingle | Simultaneous strong separations of probabilistic and unambiguous complexity classes Computational complexity Probabilities |
| title | Simultaneous strong separations of probabilistic and unambiguous complexity classes |
| title_auth | Simultaneous strong separations of probabilistic and unambiguous complexity classes |
| title_exact_search | Simultaneous strong separations of probabilistic and unambiguous complexity classes |
| title_full | Simultaneous strong separations of probabilistic and unambiguous complexity classes David Eppstein ... |
| title_fullStr | Simultaneous strong separations of probabilistic and unambiguous complexity classes David Eppstein ... |
| title_full_unstemmed | Simultaneous strong separations of probabilistic and unambiguous complexity classes David Eppstein ... |
| title_short | Simultaneous strong separations of probabilistic and unambiguous complexity classes |
| title_sort | simultaneous strong separations of probabilistic and unambiguous complexity classes |
| topic | Computational complexity Probabilities |
| topic_facet | Computational complexity Probabilities |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT eppsteindavid simultaneousstrongseparationsofprobabilisticandunambiguouscomplexityclasses |