The complexity of problems defined by boolean circuits:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Würzburg
Inst. für Informatik
2000
|
| Schriftenreihe: | Report / Institut für Informatik, Würzburg
255 |
| Beschreibung: | 7 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV013859615 | ||
| 003 | DE-604 | ||
| 005 | 20010808 | ||
| 007 | t | ||
| 008 | 010808s2000 |||| 00||| eng d | ||
| 035 | |a (OCoLC)633879095 | ||
| 035 | |a (DE-599)BVBBV013859615 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 | ||
| 100 | 1 | |a Reith, Steffen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The complexity of problems defined by boolean circuits |c Steffen Reith und Klaus W. Wagner |
| 264 | 1 | |a Würzburg |b Inst. für Informatik |c 2000 | |
| 300 | |a 7 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Report / Institut für Informatik, Würzburg |v 255 | |
| 700 | 1 | |a Wagner, Klaus W. |e Verfasser |4 aut | |
| 810 | 2 | |a Institut für Informatik, Würzburg |t Report |v 255 |w (DE-604)BV007935168 |9 255 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009479118 | ||
Datensatz im Suchindex
| _version_ | 1804128693026553856 |
|---|---|
| any_adam_object | |
| author | Reith, Steffen Wagner, Klaus W. |
| author_facet | Reith, Steffen Wagner, Klaus W. |
| author_role | aut aut |
| author_sort | Reith, Steffen |
| author_variant | s r sr k w w kw kww |
| building | Verbundindex |
| bvnumber | BV013859615 |
| ctrlnum | (OCoLC)633879095 (DE-599)BVBBV013859615 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00897nam a2200277 cb4500</leader><controlfield tag="001">BV013859615</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010808 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">010808s2000 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633879095</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013859615</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Reith, Steffen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of problems defined by boolean circuits</subfield><subfield code="c">Steffen Reith und Klaus W. Wagner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Würzburg</subfield><subfield code="b">Inst. für Informatik</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 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">Report / Institut für Informatik, Würzburg</subfield><subfield code="v">255</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wagner, Klaus W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Institut für Informatik, Würzburg</subfield><subfield code="t">Report</subfield><subfield code="v">255</subfield><subfield code="w">(DE-604)BV007935168</subfield><subfield code="9">255</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009479118</subfield></datafield></record></collection> |
| id | DE-604.BV013859615 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:53:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009479118 |
| oclc_num | 633879095 |
| open_access_boolean | |
| owner | DE-20 |
| owner_facet | DE-20 |
| physical | 7 S. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Inst. für Informatik |
| record_format | marc |
| series2 | Report / Institut für Informatik, Würzburg |
| spelling | Reith, Steffen Verfasser aut The complexity of problems defined by boolean circuits Steffen Reith und Klaus W. Wagner Würzburg Inst. für Informatik 2000 7 S. txt rdacontent n rdamedia nc rdacarrier Report / Institut für Informatik, Würzburg 255 Wagner, Klaus W. Verfasser aut Institut für Informatik, Würzburg Report 255 (DE-604)BV007935168 255 |
| spellingShingle | Reith, Steffen Wagner, Klaus W. The complexity of problems defined by boolean circuits |
| title | The complexity of problems defined by boolean circuits |
| title_auth | The complexity of problems defined by boolean circuits |
| title_exact_search | The complexity of problems defined by boolean circuits |
| title_full | The complexity of problems defined by boolean circuits Steffen Reith und Klaus W. Wagner |
| title_fullStr | The complexity of problems defined by boolean circuits Steffen Reith und Klaus W. Wagner |
| title_full_unstemmed | The complexity of problems defined by boolean circuits Steffen Reith und Klaus W. Wagner |
| title_short | The complexity of problems defined by boolean circuits |
| title_sort | the complexity of problems defined by boolean circuits |
| volume_link | (DE-604)BV007935168 |
| work_keys_str_mv | AT reithsteffen thecomplexityofproblemsdefinedbybooleancircuits AT wagnerklausw thecomplexityofproblemsdefinedbybooleancircuits |