Proof complexity and feasible arithmetics: DIMACS workshop April 21 - 24, 1996
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Providence; RI
American Mathematical Society
1998
|
| Schriftenreihe: | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science
39 |
| Schlagworte: | |
| Beschreibung: | XII, 320 S. |
| ISBN: | 0821805770 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011745308 | ||
| 003 | DE-604 | ||
| 005 | 20101130 | ||
| 007 | t | ||
| 008 | 980202s1998 xxu |||| 10||| eng d | ||
| 020 | |a 0821805770 |9 0-8218-0577-0 | ||
| 035 | |a (OCoLC)37465135 | ||
| 035 | |a (DE-599)BVBBV011745308 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-739 |a DE-20 |a DE-11 | ||
| 050 | 0 | |a QA9.54 | |
| 082 | 0 | |a 511.3 |2 21 | |
| 084 | |a SD 1996 |0 (DE-625)142730: |2 rvk | ||
| 245 | 1 | 0 | |a Proof complexity and feasible arithmetics |b DIMACS workshop April 21 - 24, 1996 |c Paul W. Beame, eds. |
| 264 | 1 | |a Providence; RI |b American Mathematical Society |c 1998 | |
| 300 | |a XII, 320 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 39 | |
| 650 | 7 | |a Bewijstheorie |2 gtt | |
| 650 | 7 | |a Complexiteit |2 gtt | |
| 650 | 7 | |a Recursie |2 gtt | |
| 650 | 4 | |a Computational complexity |v Congresses | |
| 650 | 4 | |a Constructive mathematics |v Congresses | |
| 650 | 4 | |a Proof theory |v Congresses | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 700 | 1 | |a Beame, Paul W. |d 1959- |e Sonstige |0 (DE-588)138768587 |4 oth | |
| 711 | 2 | |a Workshop on Feasible Arithmetics and Length of Proof |d 1996 |c New Brunswick |j Sonstige |0 (DE-588)5279012-5 |4 oth | |
| 830 | 0 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 39 |w (DE-604)BV004648770 |9 39 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007924408 | ||
Datensatz im Suchindex
| _version_ | 1804126287512469504 |
|---|---|
| any_adam_object | |
| author_GND | (DE-588)138768587 |
| building | Verbundindex |
| bvnumber | BV011745308 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.54 |
| callnumber-search | QA9.54 |
| callnumber-sort | QA 19.54 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SD 1996 |
| ctrlnum | (OCoLC)37465135 (DE-599)BVBBV011745308 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01733nam a2200421 cb4500</leader><controlfield tag="001">BV011745308</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20101130 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980202s1998 xxu |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0821805770</subfield><subfield code="9">0-8218-0577-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37465135</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011745308</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.54</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SD 1996</subfield><subfield code="0">(DE-625)142730:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proof complexity and feasible arithmetics</subfield><subfield code="b">DIMACS workshop April 21 - 24, 1996</subfield><subfield code="c">Paul W. Beame, eds.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence; RI</subfield><subfield code="b">American Mathematical Society</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 320 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">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">39</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bewijstheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constructive mathematics</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Beame, Paul W.</subfield><subfield code="d">1959-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)138768587</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">Workshop on Feasible Arithmetics and Length of Proof</subfield><subfield code="d">1996</subfield><subfield code="c">New Brunswick</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)5279012-5</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">39</subfield><subfield code="w">(DE-604)BV004648770</subfield><subfield code="9">39</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007924408</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV011745308 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:15:03Z |
| institution | BVB |
| institution_GND | (DE-588)5279012-5 |
| isbn | 0821805770 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007924408 |
| oclc_num | 37465135 |
| open_access_boolean | |
| owner | DE-739 DE-20 DE-11 |
| owner_facet | DE-739 DE-20 DE-11 |
| physical | XII, 320 S. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | American Mathematical Society |
| record_format | marc |
| series | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
| series2 | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
| spelling | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 Paul W. Beame, eds. Providence; RI American Mathematical Society 1998 XII, 320 S. txt rdacontent n rdamedia nc rdacarrier Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 39 Bewijstheorie gtt Complexiteit gtt Recursie gtt Computational complexity Congresses Constructive mathematics Congresses Proof theory Congresses (DE-588)1071861417 Konferenzschrift gnd-content Beame, Paul W. 1959- Sonstige (DE-588)138768587 oth Workshop on Feasible Arithmetics and Length of Proof 1996 New Brunswick Sonstige (DE-588)5279012-5 oth Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 39 (DE-604)BV004648770 39 |
| spellingShingle | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science Bewijstheorie gtt Complexiteit gtt Recursie gtt Computational complexity Congresses Constructive mathematics Congresses Proof theory Congresses |
| subject_GND | (DE-588)1071861417 |
| title | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 |
| title_auth | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 |
| title_exact_search | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 |
| title_full | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 Paul W. Beame, eds. |
| title_fullStr | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 Paul W. Beame, eds. |
| title_full_unstemmed | Proof complexity and feasible arithmetics DIMACS workshop April 21 - 24, 1996 Paul W. Beame, eds. |
| title_short | Proof complexity and feasible arithmetics |
| title_sort | proof complexity and feasible arithmetics dimacs workshop april 21 24 1996 |
| title_sub | DIMACS workshop April 21 - 24, 1996 |
| topic | Bewijstheorie gtt Complexiteit gtt Recursie gtt Computational complexity Congresses Constructive mathematics Congresses Proof theory Congresses |
| topic_facet | Bewijstheorie Complexiteit Recursie Computational complexity Congresses Constructive mathematics Congresses Proof theory Congresses Konferenzschrift |
| volume_link | (DE-604)BV004648770 |
| work_keys_str_mv | AT beamepaulw proofcomplexityandfeasiblearithmeticsdimacsworkshopapril21241996 AT workshoponfeasiblearithmeticsandlengthofproofnewbrunswick proofcomplexityandfeasiblearithmeticsdimacsworkshopapril21241996 |