000			01985nam a22005175i 4500
001			978-3-642-03685-9
003			DE-He213
005			20130515021924.0
007			cr nn 008mamaa
008			100301s2009 gw | s |||| 0|eng d
020			_a9783642036859 _9978-3-642-03685-9
024	7		_a10.1007/978-3-642-03685-9 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
100	1		_aDinur, Irit.
245	1	0	_aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques _h[electronic resource] : _b12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings / _cedited by Irit Dinur, Klaus Jansen, Joseph Naor, José Rolim.
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009.
300			_bdigital.
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v5687
650		0	_aComputer science.
650		0	_aCoding theory.
650		0	_aComputer software.
650		0	_aElectronic data processing.
650		0	_aComputational complexity.
650		0	_aAlgebra _xData processing.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aNumeric Computing.
650	2	4	_aSymbolic and Algebraic Manipulation.
650	2	4	_aProbability and Statistics in Computer Science.
650	2	4	_aCoding and Information Theory.
700	1		_aJansen, Klaus.
700	1		_aNaor, Joseph.
700	1		_aRolim, José.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642036842
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v5687
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-03685-9
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c82263 _d82263