The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Laboratory for Computer Science
1979
|
| Schlagworte: | |
| Beschreibung: | Vollst. zugl.: Diss., 1977 |
| Beschreibung: | 226 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876468 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880308s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)6540611 | ||
| 035 | |a (DE-599)BVBBV021876468 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76 | |
| 088 | |a MIT/LCS/TR-238 | ||
| 100 | 1 | |a Bloniarz, Peter A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph |c by Peter Anthony Bloniarz |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Laboratory for Computer Science |c 1979 | |
| 300 | |a 226 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Vollst. zugl.: Diss., 1977 | ||
| 650 | 4 | |a Boole, Algèbre de | |
| 650 | 4 | |a Circuits logiques | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Fonctions monotones | |
| 650 | 4 | |a Graphes, Théorie des | |
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015092077 | ||
Datensatz im Suchindex
| _version_ | 1804135815994933248 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bloniarz, Peter A. |
| author_facet | Bloniarz, Peter A. |
| author_role | aut |
| author_sort | Bloniarz, Peter A. |
| author_variant | p a b pa pab |
| building | Verbundindex |
| bvnumber | BV021876468 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)6540611 (DE-599)BVBBV021876468 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01451nam a2200445zc 4500</leader><controlfield tag="001">BV021876468</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880308s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)6540611</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876468</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-238</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bloniarz, Peter A.</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 monotone Boolean functions and an algorithm for finding shortest paths in a graph</subfield><subfield code="c">by Peter Anthony Bloniarz</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">226 Bl.</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="500" ind1=" " ind2=" "><subfield code="a">Vollst. zugl.: Diss., 1977</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Boole, Algèbre de</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Circuits logiques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions monotones</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-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">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</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-015092077</subfield></datafield></record></collection> |
| id | DE-604.BV021876468 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:36Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015092077 |
| oclc_num | 6540611 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 226 Bl. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Massachusetts Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Bloniarz, Peter A. Verfasser aut The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph by Peter Anthony Bloniarz Cambridge, Mass. Massachusetts Inst. of Technology, Laboratory for Computer Science 1979 226 Bl. txt rdacontent n rdamedia nc rdacarrier Vollst. zugl.: Diss., 1977 Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Fonctions monotones Graphes, Théorie des Algebra, Boolean Algorithms Computational complexity Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Graph (DE-588)4021842-9 s DE-604 Kürzester-Weg-Problem (DE-588)4138403-9 s |
| spellingShingle | Bloniarz, Peter A. The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Fonctions monotones Graphes, Théorie des Algebra, Boolean Algorithms Computational complexity Kürzester-Weg-Problem (DE-588)4138403-9 gnd Graph (DE-588)4021842-9 gnd |
| subject_GND | (DE-588)4138403-9 (DE-588)4021842-9 |
| title | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph |
| title_auth | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph |
| title_exact_search | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph |
| title_exact_search_txtP | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph |
| title_full | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph by Peter Anthony Bloniarz |
| title_fullStr | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph by Peter Anthony Bloniarz |
| title_full_unstemmed | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph by Peter Anthony Bloniarz |
| title_short | The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph |
| title_sort | the complexity of monotone boolean functions and an algorithm for finding shortest paths in a graph |
| topic | Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Fonctions monotones Graphes, Théorie des Algebra, Boolean Algorithms Computational complexity Kürzester-Weg-Problem (DE-588)4138403-9 gnd Graph (DE-588)4021842-9 gnd |
| topic_facet | Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Fonctions monotones Graphes, Théorie des Algebra, Boolean Algorithms Computational complexity Kürzester-Weg-Problem Graph |
| work_keys_str_mv | AT bloniarzpetera thecomplexityofmonotonebooleanfunctionsandanalgorithmforfindingshortestpathsinagraph |