Algorithms from complexity theory: polynomial-time operations for complex sets
Abstract: "Typically, a set is described as complex when its membership problem has no efficient solution. Many sets of central interest for data management, design of computer chips, scheduling, fault- tolerant network design, and general optimization -- such as the NP- complete sets -- are th...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Rochester, NY
1990
|
| Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
343 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Typically, a set is described as complex when its membership problem has no efficient solution. Many sets of central interest for data management, design of computer chips, scheduling, fault- tolerant network design, and general optimization -- such as the NP- complete sets -- are thought to be complex in this sense. Though much effort has been spent accumulating evidence of the infeasibility of membership testing for these sets, less effort has been spent determining which operations can be efficiently performed on complex sets This paper surveys recent advances in the study of the sets for which fundamental operations -- data compression and hashing, approximate membership testing, and enumeration -- can be performed efficiently. We will see that many sets traditionally viewed as complex nonetheless have efficient algorithms for these operations. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008950528 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24875170 | ||
| 035 | |a (DE-599)BVBBV008950528 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Hemachandra, Lane A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms from complexity theory |b polynomial-time operations for complex sets |
| 264 | 1 | |a Rochester, NY |c 1990 | |
| 300 | |a 12 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 343 | |
| 520 | 3 | |a Abstract: "Typically, a set is described as complex when its membership problem has no efficient solution. Many sets of central interest for data management, design of computer chips, scheduling, fault- tolerant network design, and general optimization -- such as the NP- complete sets -- are thought to be complex in this sense. Though much effort has been spent accumulating evidence of the infeasibility of membership testing for these sets, less effort has been spent determining which operations can be efficiently performed on complex sets | |
| 520 | 3 | |a This paper surveys recent advances in the study of the sets for which fundamental operations -- data compression and hashing, approximate membership testing, and enumeration -- can be performed efficiently. We will see that many sets traditionally viewed as complex nonetheless have efficient algorithms for these operations. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Polynomials | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 343 |w (DE-604)BV008902697 |9 343 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005906091 | ||
Datensatz im Suchindex
| _version_ | 1804123283932577792 |
|---|---|
| any_adam_object | |
| author | Hemachandra, Lane A. |
| author_facet | Hemachandra, Lane A. |
| author_role | aut |
| author_sort | Hemachandra, Lane A. |
| author_variant | l a h la lah |
| building | Verbundindex |
| bvnumber | BV008950528 |
| ctrlnum | (OCoLC)24875170 (DE-599)BVBBV008950528 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01873nam a2200313 cb4500</leader><controlfield tag="001">BV008950528</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)24875170</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008950528</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="100" ind1="1" ind2=" "><subfield code="a">Hemachandra, Lane A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms from complexity theory</subfield><subfield code="b">polynomial-time operations for complex sets</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">12 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">343</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Typically, a set is described as complex when its membership problem has no efficient solution. Many sets of central interest for data management, design of computer chips, scheduling, fault- tolerant network design, and general optimization -- such as the NP- complete sets -- are thought to be complex in this sense. Though much effort has been spent accumulating evidence of the infeasibility of membership testing for these sets, less effort has been spent determining which operations can be efficiently performed on complex sets</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This paper surveys recent advances in the study of the sets for which fundamental operations -- data compression and hashing, approximate membership testing, and enumeration -- can be performed efficiently. We will see that many sets traditionally viewed as complex nonetheless have efficient algorithms for these operations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</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">343</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">343</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005906091</subfield></datafield></record></collection> |
| id | DE-604.BV008950528 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005906091 |
| oclc_num | 24875170 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 12 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Hemachandra, Lane A. Verfasser aut Algorithms from complexity theory polynomial-time operations for complex sets Rochester, NY 1990 12 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 343 Abstract: "Typically, a set is described as complex when its membership problem has no efficient solution. Many sets of central interest for data management, design of computer chips, scheduling, fault- tolerant network design, and general optimization -- such as the NP- complete sets -- are thought to be complex in this sense. Though much effort has been spent accumulating evidence of the infeasibility of membership testing for these sets, less effort has been spent determining which operations can be efficiently performed on complex sets This paper surveys recent advances in the study of the sets for which fundamental operations -- data compression and hashing, approximate membership testing, and enumeration -- can be performed efficiently. We will see that many sets traditionally viewed as complex nonetheless have efficient algorithms for these operations. Algorithms Polynomials Department of Computer Science: Technical report University of Rochester <Rochester, NY> 343 (DE-604)BV008902697 343 |
| spellingShingle | Hemachandra, Lane A. Algorithms from complexity theory polynomial-time operations for complex sets Algorithms Polynomials |
| title | Algorithms from complexity theory polynomial-time operations for complex sets |
| title_auth | Algorithms from complexity theory polynomial-time operations for complex sets |
| title_exact_search | Algorithms from complexity theory polynomial-time operations for complex sets |
| title_full | Algorithms from complexity theory polynomial-time operations for complex sets |
| title_fullStr | Algorithms from complexity theory polynomial-time operations for complex sets |
| title_full_unstemmed | Algorithms from complexity theory polynomial-time operations for complex sets |
| title_short | Algorithms from complexity theory |
| title_sort | algorithms from complexity theory polynomial time operations for complex sets |
| title_sub | polynomial-time operations for complex sets |
| topic | Algorithms Polynomials |
| topic_facet | Algorithms Polynomials |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT hemachandralanea algorithmsfromcomplexitytheorypolynomialtimeoperationsforcomplexsets |