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:	Electronic eBook
Language:	English
Published:	Boston Academic Press ©1987
Series:	Perspectives in computing (Boston, Mass.) vol. 15
Subjects:	algorithme discret complexité complexité calcul Programmation (Informatique) / Congrès Algorithmes / Congrès Complexité de calcul (Informatique) / Congrès Algoritmen Complexiteit Complexité de calcul (informatique) / Congrès Computational complexity Computer algorithms Computer programming Computer programming > Congresses Computer algorithms > Congresses Computational complexity > Congresses Diskretes Modell Komplexität Komplexitätstheorie Algorithmus Programmierung Datenverarbeitung Kyōto Konferenzschrift
Online Access:	FAW01 Volltext
Item Description:	"Sponsored by the Japan Society for Promotion of Science and the U.S. National Science Foundation"--Foreword Includes bibliographical references
Physical Description:	xi, 483 pages
ISBN:	9780123868701 012386870X

Staff View

MARC


LEADER	00000nmm a2200000zcb4500
001	BV044379851
003	DE-604
005	00000000000000.0
007	cr\|uuu---uuuuu
008	170630s1987 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
020			\|a 9780123868701 \|9 978-0-12-386870-1
020			\|a 012386870X \|9 0-12-386870-X
035			\|a (ZDB-33-ESD)ocn574722172
035			\|a (OCoLC)574722172
035			\|a (DE-599)BVBBV044379851
040			\|a DE-604 \|b ger \|e aacr
041	0		\|a eng
049			\|a DE-1046
082	0		\|a 511 \|2 19eng
245	1	0	\|a Discrete algorithms and complexity \|b proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan \|c edited by David S. Johnson [and others]
264		1	\|a Boston \|b Academic Press \|c ©1987
300			\|a xi, 483 pages
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	0		\|a Perspectives in computing (Boston, Mass.) \|v vol. 15
500			\|a "Sponsored by the Japan Society for Promotion of Science and the U.S. National Science Foundation"--Foreword
500			\|a Includes bibliographical references
650		4	\|a algorithme discret
650		4	\|a complexité
650		4	\|a complexité calcul
650		4	\|a Programmation (Informatique) / Congrès
650		4	\|a Algorithmes / Congrès
650		4	\|a Complexité de calcul (Informatique) / Congrès
650		7	\|a Algoritmen \|2 gtt
650		7	\|a Complexiteit \|2 gtt
650		7	\|a Algorithmes / Congrès \|2 ram
650		7	\|a Complexité de calcul (informatique) / Congrès \|2 ram
650		7	\|a Computational complexity \|2 fast
650		7	\|a Computer algorithms \|2 fast
650		7	\|a Computer programming \|2 fast
650		4	\|a Computer programming \|v Congresses
650		4	\|a Computer algorithms \|v Congresses
650		4	\|a Computational complexity \|v Congresses
650	0	7	\|a Diskretes Modell \|0 (DE-588)7521531-7 \|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 Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Programmierung \|0 (DE-588)4076370-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|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 Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	0	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|8 1\p \|5 DE-604
689	1	0	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|D s
689	1	1	\|a Kyōto \|0 (DE-588)4073426-2 \|D g
689	1		\|8 2\p \|5 DE-604
689	2	0	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	2	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	2		\|8 3\p \|5 DE-604
689	3	0	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	3	1	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|D s
689	3		\|8 4\p \|5 DE-604
689	4	0	\|a Programmierung \|0 (DE-588)4076370-5 \|D s
689	4		\|8 5\p \|5 DE-604
689	5	0	\|a Diskretes Modell \|0 (DE-588)7521531-7 \|D s
689	5		\|8 6\p \|5 DE-604
700	1		\|a Johnson, David S. \|e Sonstige \|4 oth
710	2		\|a Nihon Gakujutsu Shinkōkai \|e Sonstige \|4 oth
710	2		\|a National Science Foundation (U.S.) \|e Sonstige \|4 oth
710	2		\|a Japan-US Joint Seminar on Discrete Algorithms and Complexity Theory <1986, Kyoto, Japan> \|e Sonstige \|4 oth
856	4	0	\|u http://www.sciencedirect.com/science/book/9780123868701 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
912			\|a ZDB-33-ESD
999			\|a oai:aleph.bib-bvb.de:BVB01-029782073
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
966	e		\|u http://www.sciencedirect.com/science/book/9780123868701 \|l FAW01 \|p ZDB-33-ESD \|q FAW_PDA_ESD \|x Verlag \|3 Volltext

Record in the Search Index

_version_	1804177641746464768
any_adam_object
building	Verbundindex
bvnumber	BV044379851
collection	ZDB-33-ESD
ctrlnum	(ZDB-33-ESD)ocn574722172 (OCoLC)574722172 (DE-599)BVBBV044379851
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
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04127nmm a2200949zcb4500</leader><controlfield tag="001">BV044379851</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">170630s1987 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780123868701</subfield><subfield code="9">978-0-12-386870-1</subfield></datafield><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">(ZDB-33-ESD)ocn574722172</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)574722172</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044379851</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</subfield><subfield code="2">19eng</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><subfield code="c">edited by David S. Johnson [and others]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston</subfield><subfield code="b">Academic Press</subfield><subfield code="c">©1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xi, 483 pages</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Perspectives in computing (Boston, Mass.)</subfield><subfield code="v">vol. 15</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"Sponsored by the Japan Society for Promotion of Science and the U.S. National Science Foundation"--Foreword</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">algorithme discret</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">complexité</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">complexité calcul</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique) / Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes / Congrès</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">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="7"><subfield code="a">Algorithmes / Congrès</subfield><subfield code="2">ram</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="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programming</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</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">Computational complexity</subfield><subfield code="v">Congresses</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="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">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">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">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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="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">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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Diskretes Modell</subfield><subfield code="0">(DE-588)7521531-7</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="700" ind1="1" ind2=" "><subfield code="a">Johnson, David S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Nihon Gakujutsu Shinkōkai</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">National Science Foundation (U.S.)</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Japan-US Joint Seminar on Discrete Algorithms and Complexity Theory <1986, Kyoto, Japan></subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780123868701</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029782073</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="966" ind1="e" ind2=" "><subfield code="u">http://www.sciencedirect.com/science/book/9780123868701</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FAW_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</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.BV044379851
illustrated	Not Illustrated
indexdate	2024-07-10T07:51:19Z
institution	BVB
isbn	9780123868701 012386870X
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-029782073
oclc_num	574722172
open_access_boolean
owner	DE-1046
owner_facet	DE-1046
physical	xi, 483 pages
psigel	ZDB-33-ESD ZDB-33-ESD FAW_PDA_ESD
publishDate	1987
publishDateSearch	1987
publishDateSort	1987
publisher	Academic Press
record_format	marc
series2	Perspectives in computing (Boston, Mass.)
spelling	Discrete algorithms and complexity proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan edited by David S. Johnson [and others] Boston Academic Press ©1987 xi, 483 pages txt rdacontent c rdamedia cr rdacarrier Perspectives in computing (Boston, Mass.) vol. 15 "Sponsored by the Japan Society for Promotion of Science and the U.S. National Science Foundation"--Foreword Includes bibliographical references algorithme discret complexité complexité calcul Programmation (Informatique) / Congrès Algorithmes / Congrès Complexité de calcul (Informatique) / Congrès Algoritmen gtt Complexiteit gtt Algorithmes / Congrès ram Complexité de calcul (informatique) / Congrès ram Computational complexity fast Computer algorithms fast Computer programming fast Computer programming Congresses Computer algorithms Congresses Computational complexity Congresses Diskretes Modell (DE-588)7521531-7 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Kyōto (DE-588)4073426-2 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content 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 Diskretes Modell (DE-588)7521531-7 s 6\p DE-604 Johnson, David S. Sonstige oth Nihon Gakujutsu Shinkōkai Sonstige oth National Science Foundation (U.S.) Sonstige oth Japan-US Joint Seminar on Discrete Algorithms and Complexity Theory <1986, Kyoto, Japan> Sonstige oth http://www.sciencedirect.com/science/book/9780123868701 Verlag URL des Erstveröffentlichers Volltext 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
spellingShingle	Discrete algorithms and complexity proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan algorithme discret complexité complexité calcul Programmation (Informatique) / Congrès Algorithmes / Congrès Complexité de calcul (Informatique) / Congrès Algoritmen gtt Complexiteit gtt Algorithmes / Congrès ram Complexité de calcul (informatique) / Congrès ram Computational complexity fast Computer algorithms fast Computer programming fast Computer programming Congresses Computer algorithms Congresses Computational complexity Congresses Diskretes Modell (DE-588)7521531-7 gnd Komplexität (DE-588)4135369-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd Programmierung (DE-588)4076370-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd
subject_GND	(DE-588)7521531-7 (DE-588)4135369-9 (DE-588)4120591-1 (DE-588)4001183-5 (DE-588)4076370-5 (DE-588)4011152-0 (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_full	Discrete algorithms and complexity proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan edited by David S. Johnson [and others]
title_fullStr	Discrete algorithms and complexity proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan edited by David S. Johnson [and others]
title_full_unstemmed	Discrete algorithms and complexity proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan edited by David S. Johnson [and others]
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	algorithme discret complexité complexité calcul Programmation (Informatique) / Congrès Algorithmes / Congrès Complexité de calcul (Informatique) / Congrès Algoritmen gtt Complexiteit gtt Algorithmes / Congrès ram Complexité de calcul (informatique) / Congrès ram Computational complexity fast Computer algorithms fast Computer programming fast Computer programming Congresses Computer algorithms Congresses Computational complexity Congresses Diskretes Modell (DE-588)7521531-7 gnd Komplexität (DE-588)4135369-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd Programmierung (DE-588)4076370-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd
topic_facet	algorithme discret complexité complexité calcul Programmation (Informatique) / Congrès Algorithmes / Congrès Complexité de calcul (Informatique) / Congrès Algoritmen Complexiteit Complexité de calcul (informatique) / Congrès Computational complexity Computer algorithms Computer programming Computer programming Congresses Computer algorithms Congresses Computational complexity Congresses Diskretes Modell Komplexität Komplexitätstheorie Algorithmus Programmierung Datenverarbeitung Kyōto Konferenzschrift
url	http://www.sciencedirect.com/science/book/9780123868701
work_keys_str_mv	AT johnsondavids discretealgorithmsandcomplexityproceedingsofthejapanusjointseminarjune461986kyotojapan AT nihongakujutsushinkokai discretealgorithmsandcomplexityproceedingsofthejapanusjointseminarjune461986kyotojapan AT nationalsciencefoundationus discretealgorithmsandcomplexityproceedingsofthejapanusjointseminarjune461986kyotojapan AT japanusjointseminarondiscretealgorithmsandcomplexitytheory1986kyotojapan discretealgorithmsandcomplexityproceedingsofthejapanusjointseminarjune461986kyotojapan

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text

MARC

Record in the Search Index

There is no print copy available.

Similar Items