Circuit-size lower bounds and non-reducibility to sparse sets:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1981
|
| Schlagworte: | |
| Beschreibung: | 22 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021896061 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 910225s1981 |||| 00||| und d | ||
| 035 | |a (OCoLC)475983112 | ||
| 035 | |a (DE-599)BVBBV021896061 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | |a und | ||
| 049 | |a DE-706 | ||
| 088 | |a MIT LCS TM 205 | ||
| 100 | 1 | |a Kannan, Ravindran |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Circuit-size lower bounds and non-reducibility to sparse sets |c Ravindran Kannan |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1981 | |
| 300 | |a 22 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Boolesche Funktion |0 (DE-588)4146281-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Boolesche Funktion |0 (DE-588)4146281-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015111246 | ||
Datensatz im Suchindex
| _version_ | 1804135840757055488 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Kannan, Ravindran |
| author_facet | Kannan, Ravindran |
| author_role | aut |
| author_sort | Kannan, Ravindran |
| author_variant | r k rk |
| building | Verbundindex |
| bvnumber | BV021896061 |
| ctrlnum | (OCoLC)475983112 (DE-599)BVBBV021896061 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01036nam a2200325zc 4500</leader><controlfield tag="001">BV021896061</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910225s1981 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)475983112</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021896061</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 205</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kannan, Ravindran</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Circuit-size lower bounds and non-reducibility to sparse sets</subfield><subfield code="c">Ravindran Kannan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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="650" ind1="0" ind2="7"><subfield code="a">Boolesche Funktion</subfield><subfield code="0">(DE-588)4146281-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Boolesche Funktion</subfield><subfield code="0">(DE-588)4146281-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111246</subfield></datafield></record></collection> |
| id | DE-604.BV021896061 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:04:23Z |
| indexdate | 2024-07-09T20:46:54Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111246 |
| oclc_num | 475983112 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 22 S. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Kannan, Ravindran Verfasser aut Circuit-size lower bounds and non-reducibility to sparse sets Ravindran Kannan Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1981 22 S. txt rdacontent n rdamedia nc rdacarrier Boolesche Funktion (DE-588)4146281-6 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Komplexität (DE-588)4135369-9 s DE-604 Boolesche Funktion (DE-588)4146281-6 s |
| spellingShingle | Kannan, Ravindran Circuit-size lower bounds and non-reducibility to sparse sets Boolesche Funktion (DE-588)4146281-6 gnd Komplexität (DE-588)4135369-9 gnd |
| subject_GND | (DE-588)4146281-6 (DE-588)4135369-9 |
| title | Circuit-size lower bounds and non-reducibility to sparse sets |
| title_auth | Circuit-size lower bounds and non-reducibility to sparse sets |
| title_exact_search | Circuit-size lower bounds and non-reducibility to sparse sets |
| title_exact_search_txtP | Circuit-size lower bounds and non-reducibility to sparse sets |
| title_full | Circuit-size lower bounds and non-reducibility to sparse sets Ravindran Kannan |
| title_fullStr | Circuit-size lower bounds and non-reducibility to sparse sets Ravindran Kannan |
| title_full_unstemmed | Circuit-size lower bounds and non-reducibility to sparse sets Ravindran Kannan |
| title_short | Circuit-size lower bounds and non-reducibility to sparse sets |
| title_sort | circuit size lower bounds and non reducibility to sparse sets |
| topic | Boolesche Funktion (DE-588)4146281-6 gnd Komplexität (DE-588)4135369-9 gnd |
| topic_facet | Boolesche Funktion Komplexität |
| work_keys_str_mv | AT kannanravindran circuitsizelowerboundsandnonreducibilitytosparsesets |