Holdings: Discrete algorithms and complexity

Discrete algorithms and complexity: proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan

Saved in:

Bibliographic Details
Format:	Book
Language:	English
Published:	Boston [u.a.] Acad. Pr. 1987
Edition:	1. print.
Series:	Perspectives in computing 15
Subjects:	Algorithmes - Congrès Algoritmen Complexiteit Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès Programmation (Informatique) - Congrès algorithme discret complexité calcul complexité Computational complexity > Congresses Computer algorithms > Congresses Computer programming > Congresses Komplexitätstheorie Komplexität Datenverarbeitung Programmierung Algorithmus Diskretes Modell Kyōto Konferenzschrift
Physical Description:	XI, 483 S.
ISBN:	012386870X

Staff View

MARC


LEADER	00000nam a2200000zcb4500
001	BV022134304
003	DE-604
005	20060630000000.0
007	t\|
008	880621s1987 xx \|\|\|\| 00\|\|\| eng d
020			\|a 012386870X \|9 0-12-386870-X
035			\|a (OCoLC)15053097
035			\|a (DE-599)BVBBV022134304
040			\|a DE-604 \|b ger
041	0		\|a eng
049			\|a DE-706
050		0	\|a QA76.6
082	0		\|a 511 \|2 19
245	1	0	\|a Discrete algorithms and complexity \|b proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
250			\|a 1. print.
264		1	\|a Boston [u.a.] \|b Acad. Pr. \|c 1987
300			\|a XI, 483 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Perspectives in computing \|v 15
650		4	\|a Algorithmes - Congrès
650		7	\|a Algorithmes - Congrès \|2 ram
650		7	\|a Algoritmen \|2 gtt
650		7	\|a Complexiteit \|2 gtt
650		4	\|a Complexité de calcul (Informatique) - Congrès
650		7	\|a Complexité de calcul (informatique) - Congrès \|2 ram
650		4	\|a Programmation (Informatique) - Congrès
650		7	\|a algorithme discret \|2 inriac
650		7	\|a complexité calcul \|2 inriac
650		7	\|a complexité \|2 inriac
650		4	\|a Computational complexity \|v Congresses
650		4	\|a Computer algorithms \|v Congresses
650		4	\|a Computer programming \|v Congresses
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexität \|0 (DE-588)4135369-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Programmierung \|0 (DE-588)4076370-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Diskretes Modell \|0 (DE-588)7521531-7 \|2 gnd \|9 rswk-swf
651		7	\|a Kyōto \|0 (DE-588)4073426-2 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|2 gnd-content
689	0	0	\|a Diskretes Modell \|0 (DE-588)7521531-7 \|D s
689	0		\|5 DE-604
689	1	0	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	1	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	1		\|8 1\p \|5 DE-604
689	2	0	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|D s
689	2	1	\|a Kyōto \|0 (DE-588)4073426-2 \|D g
689	2		\|8 2\p \|5 DE-604
689	3	0	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	3	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	3		\|8 3\p \|5 DE-604
689	4	0	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	4	1	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|D s
689	4		\|8 4\p \|5 DE-604
689	5	0	\|a Programmierung \|0 (DE-588)4076370-5 \|D s
689	5		\|8 5\p \|5 DE-604
700	1		\|a Johnson, David S. \|e Sonstige \|4 oth
830		0	\|a Perspectives in computing \|v 15 \|w (DE-604)BV000736883
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
943	1		\|a oai:aleph.bib-bvb.de:BVB01-015348922

Record in the Search Index

_version_	1820868047394570240
adam_text
adam_txt
any_adam_object
any_adam_object_boolean
building	Verbundindex
bvnumber	BV022134304
callnumber-first	Q - Science
callnumber-label	QA76
callnumber-raw	QA76.6
callnumber-search	QA76.6
callnumber-sort	QA 276.6
callnumber-subject	QA - Mathematics
classification_rvk	SS 1986
ctrlnum	(OCoLC)15053097 (DE-599)BVBBV022134304
dewey-full	511
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511
dewey-search	511
dewey-sort	3511
dewey-tens	510 - Mathematics
discipline	Mathematik
discipline_str_mv	Informatik Mathematik
edition	1. print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV022134304</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060630000000.0</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">880621s1987 xx \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">012386870X</subfield><subfield code="9">0-12-386870-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15053097</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022134304</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.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</subfield><subfield code="2">19</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discrete algorithms and complexity</subfield><subfield code="b">proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Acad. Pr.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 483 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">Perspectives in computing</subfield><subfield code="v">15</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</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="4"><subfield code="a">Complexité de calcul (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme discret</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité</subfield><subfield code="2">inriac</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">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield><subfield code="v">Congresses</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">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="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskretes Modell</subfield><subfield code="0">(DE-588)7521531-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="651" ind1=" " ind2="7"><subfield code="a">Kyōto</subfield><subfield code="0">(DE-588)4073426-2</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">Diskretes Modell</subfield><subfield code="0">(DE-588)7521531-7</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Kyōto</subfield><subfield code="0">(DE-588)4073426-2</subfield><subfield code="D">g</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, David S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Perspectives in computing</subfield><subfield code="v">15</subfield><subfield code="w">(DE-604)BV000736883</subfield><subfield code="9"></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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015348922</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift gnd-content
genre_facet	Konferenzschrift
geographic	Kyōto (DE-588)4073426-2 gnd
geographic_facet	Kyōto
id	DE-604.BV022134304
illustrated	Not Illustrated
index_date	2024-07-02T16:17:10Z
indexdate	2025-01-10T13:18:10Z
institution	BVB
isbn	012386870X
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-015348922
oclc_num	15053097
open_access_boolean
owner	DE-706
owner_facet	DE-706
physical	XI, 483 S.
publishDate	1987
publishDateSearch	1987
publishDateSort	1987
publisher	Acad. Pr.
record_format	marc
series	Perspectives in computing
series2	Perspectives in computing
spelling	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan 1. print. Boston [u.a.] Acad. Pr. 1987 XI, 483 S. txt rdacontent n rdamedia nc rdacarrier Perspectives in computing 15 Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram Programmation (Informatique) - Congrès algorithme discret inriac complexité calcul inriac complexité inriac Computational complexity Congresses Computer algorithms Congresses Computer programming Congresses Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Diskretes Modell (DE-588)7521531-7 gnd rswk-swf Kyōto (DE-588)4073426-2 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Diskretes Modell (DE-588)7521531-7 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Datenverarbeitung (DE-588)4011152-0 s Kyōto (DE-588)4073426-2 g 2\p DE-604 Komplexität (DE-588)4135369-9 s 3\p DE-604 4\p DE-604 Programmierung (DE-588)4076370-5 s 5\p DE-604 Johnson, David S. Sonstige oth Perspectives in computing 15 (DE-604)BV000736883 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
spellingShingle	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan Perspectives in computing Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram Programmation (Informatique) - Congrès algorithme discret inriac complexité calcul inriac complexité inriac Computational complexity Congresses Computer algorithms Congresses Computer programming Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Komplexität (DE-588)4135369-9 gnd Datenverarbeitung (DE-588)4011152-0 gnd Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd Diskretes Modell (DE-588)7521531-7 gnd
subject_GND	(DE-588)4120591-1 (DE-588)4135369-9 (DE-588)4011152-0 (DE-588)4076370-5 (DE-588)4001183-5 (DE-588)7521531-7 (DE-588)4073426-2 (DE-588)1071861417
title	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
title_auth	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
title_exact_search	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
title_exact_search_txtP	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
title_full	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
title_fullStr	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
title_full_unstemmed	Discrete algorithms and complexity proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
title_short	Discrete algorithms and complexity
title_sort	discrete algorithms and complexity proceedings of the japan us joint seminar june 4 6 1986 kyoto japan
title_sub	proceedings of the Japan-US joint seminar, june 4-6, 1986, Kyoto, Japan
topic	Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Complexiteit gtt Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram Programmation (Informatique) - Congrès algorithme discret inriac complexité calcul inriac complexité inriac Computational complexity Congresses Computer algorithms Congresses Computer programming Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Komplexität (DE-588)4135369-9 gnd Datenverarbeitung (DE-588)4011152-0 gnd Programmierung (DE-588)4076370-5 gnd Algorithmus (DE-588)4001183-5 gnd Diskretes Modell (DE-588)7521531-7 gnd
topic_facet	Algorithmes - Congrès Algoritmen Complexiteit Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès Programmation (Informatique) - Congrès algorithme discret complexité calcul complexité Computational complexity Congresses Computer algorithms Congresses Computer programming Congresses Komplexitätstheorie Komplexität Datenverarbeitung Programmierung Algorithmus Diskretes Modell Kyōto Konferenzschrift
volume_link	(DE-604)BV000736883
work_keys_str_mv	AT johnsondavids discretealgorithmsandcomplexityproceedingsofthejapanusjointseminarjune461986kyotojapan

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!

MARC

Record in the Search Index

There is no print copy available.

Similar Items