Verfügbarkeit: Proceedings :: THWS Bibkatalog

Proceedings: 7 - 10 July 2003, Aarhus, Denmark

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	Conference on Computational Complexity Århus (VerfasserIn)
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Los Alamitos, Calif. [u.a.] IEEE Computer Soc. 2003
Schlagworte:	Computational complexity > Congresses Logic programming > Congresses Nonlinear boundary value problems > Congresses Polynomials > Congresses Formale Sprache Datennetz Datenstruktur Komplexitätstheorie Algorithmentheorie Telekommunikationsnetz Berechnungskomplexität Konferenzschrift
Beschreibung:	XIII, 387 S.
ISBN:	0769518796

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV017401394
003	DE-604
005	20040301
007	t\|
008	030811s2003 xx \|\|\|\| 10\|\|\| eng d
020			\|a 0769518796 \|9 0-7695-1879-6
035			\|a (OCoLC)52689041
035			\|a (DE-599)BVBBV017401394
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-739
050		0	\|a QA267
111	2		\|a Conference on Computational Complexity \|n 18 \|d 2003 \|c Århus \|j Verfasser \|0 (DE-588)5552461-8 \|4 aut
245	1	0	\|a Proceedings \|b 7 - 10 July 2003, Aarhus, Denmark \|c 18th IEEE annual Conference on Computational Complexity
246	1	3	\|a Computational complexity
246	1	3	\|a CoCo 2003
264		1	\|a Los Alamitos, Calif. [u.a.] \|b IEEE Computer Soc. \|c 2003
300			\|a XIII, 387 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		4	\|a Computational complexity \|v Congresses
650		4	\|a Logic programming \|v Congresses
650		4	\|a Nonlinear boundary value problems \|v Congresses
650		4	\|a Polynomials \|v Congresses
650	0	7	\|a Formale Sprache \|0 (DE-588)4017848-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Datennetz \|0 (DE-588)4011130-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Datenstruktur \|0 (DE-588)4011146-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmentheorie \|0 (DE-588)4200409-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Telekommunikationsnetz \|0 (DE-588)4133586-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|2 gnd-content
689	0	0	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	0		\|8 1\p \|5 DE-604
689	1	0	\|a Telekommunikationsnetz \|0 (DE-588)4133586-7 \|D s
689	1		\|8 2\p \|5 DE-604
689	2	0	\|a Datennetz \|0 (DE-588)4011130-1 \|D s
689	2		\|8 3\p \|5 DE-604
689	3	0	\|a Formale Sprache \|0 (DE-588)4017848-1 \|D s
689	3		\|8 4\p \|5 DE-604
689	4	0	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	4		\|8 5\p \|5 DE-604
689	5	0	\|a Datenstruktur \|0 (DE-588)4011146-5 \|D s
689	5		\|8 6\p \|5 DE-604
689	6	0	\|a Algorithmentheorie \|0 (DE-588)4200409-3 \|D s
689	6		\|8 7\p \|5 DE-604
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 3\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 4\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 5\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 6\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 7\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-010485662

Datensatz im Suchindex

_version_	1820868172358615040
adam_text
any_adam_object
author_corporate	Conference on Computational Complexity Århus
author_corporate_role	aut
author_facet	Conference on Computational Complexity Århus
author_sort	Conference on Computational Complexity Århus
building	Verbundindex
bvnumber	BV017401394
callnumber-first	Q - Science
callnumber-label	QA267
callnumber-raw	QA267
callnumber-search	QA267
callnumber-sort	QA 3267
callnumber-subject	QA - Mathematics
classification_rvk	SS 2003
ctrlnum	(OCoLC)52689041 (DE-599)BVBBV017401394
discipline	Informatik
format	Conference Proceeding Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV017401394</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">030811s2003 xx \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0769518796</subfield><subfield code="9">0-7695-1879-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)52689041</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017401394</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-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Conference on Computational Complexity</subfield><subfield code="n">18</subfield><subfield code="d">2003</subfield><subfield code="c">Århus</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5552461-8</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings</subfield><subfield code="b">7 - 10 July 2003, Aarhus, Denmark</subfield><subfield code="c">18th IEEE annual Conference on Computational Complexity</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CoCo 2003</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Los Alamitos, Calif. [u.a.]</subfield><subfield code="b">IEEE Computer Soc.</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 387 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=" " ind2="4"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nonlinear boundary value problems</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">7\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">7\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010485662</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift gnd-content
genre_facet	Konferenzschrift
id	DE-604.BV017401394
illustrated	Not Illustrated
indexdate	2025-01-10T13:20:09Z
institution	BVB
institution_GND	(DE-588)5552461-8
isbn	0769518796
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-010485662
oclc_num	52689041
open_access_boolean
owner	DE-739
owner_facet	DE-739
physical	XIII, 387 S.
publishDate	2003
publishDateSearch	2003
publishDateSort	2003
publisher	IEEE Computer Soc.
record_format	marc
spelling	Conference on Computational Complexity 18 2003 Århus Verfasser (DE-588)5552461-8 aut Proceedings 7 - 10 July 2003, Aarhus, Denmark 18th IEEE annual Conference on Computational Complexity Computational complexity CoCo 2003 Los Alamitos, Calif. [u.a.] IEEE Computer Soc. 2003 XIII, 387 S. txt rdacontent n rdamedia nc rdacarrier Computational complexity Congresses Logic programming Congresses Nonlinear boundary value problems Congresses Polynomials Congresses Formale Sprache (DE-588)4017848-1 gnd rswk-swf Datennetz (DE-588)4011130-1 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Telekommunikationsnetz (DE-588)4133586-7 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Telekommunikationsnetz (DE-588)4133586-7 s 2\p DE-604 Datennetz (DE-588)4011130-1 s 3\p DE-604 Formale Sprache (DE-588)4017848-1 s 4\p DE-604 Berechnungskomplexität (DE-588)4134751-1 s 5\p DE-604 Datenstruktur (DE-588)4011146-5 s 6\p DE-604 Algorithmentheorie (DE-588)4200409-3 s 7\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Proceedings 7 - 10 July 2003, Aarhus, Denmark Computational complexity Congresses Logic programming Congresses Nonlinear boundary value problems Congresses Polynomials Congresses Formale Sprache (DE-588)4017848-1 gnd Datennetz (DE-588)4011130-1 gnd Datenstruktur (DE-588)4011146-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmentheorie (DE-588)4200409-3 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd
subject_GND	(DE-588)4017848-1 (DE-588)4011130-1 (DE-588)4011146-5 (DE-588)4120591-1 (DE-588)4200409-3 (DE-588)4133586-7 (DE-588)4134751-1 (DE-588)1071861417
title	Proceedings 7 - 10 July 2003, Aarhus, Denmark
title_alt	Computational complexity CoCo 2003
title_auth	Proceedings 7 - 10 July 2003, Aarhus, Denmark
title_exact_search	Proceedings 7 - 10 July 2003, Aarhus, Denmark
title_full	Proceedings 7 - 10 July 2003, Aarhus, Denmark 18th IEEE annual Conference on Computational Complexity
title_fullStr	Proceedings 7 - 10 July 2003, Aarhus, Denmark 18th IEEE annual Conference on Computational Complexity
title_full_unstemmed	Proceedings 7 - 10 July 2003, Aarhus, Denmark 18th IEEE annual Conference on Computational Complexity
title_short	Proceedings
title_sort	proceedings 7 10 july 2003 aarhus denmark
title_sub	7 - 10 July 2003, Aarhus, Denmark
topic	Computational complexity Congresses Logic programming Congresses Nonlinear boundary value problems Congresses Polynomials Congresses Formale Sprache (DE-588)4017848-1 gnd Datennetz (DE-588)4011130-1 gnd Datenstruktur (DE-588)4011146-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmentheorie (DE-588)4200409-3 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd
topic_facet	Computational complexity Congresses Logic programming Congresses Nonlinear boundary value problems Congresses Polynomials Congresses Formale Sprache Datennetz Datenstruktur Komplexitätstheorie Algorithmentheorie Telekommunikationsnetz Berechnungskomplexität Konferenzschrift
work_keys_str_mv	AT conferenceoncomputationalcomplexityarhus proceedings710july2003aarhusdenmark AT conferenceoncomputationalcomplexityarhus computationalcomplexity AT conferenceoncomputationalcomplexityarhus coco2003

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge