000			01367nam a22004215i 4500
001			978-3-540-27477-3
003			DE-He213
005			20130515021251.0
007			cr nn 008mamaa
008			100301s2005 gw | s |||| 0|eng d
020			_a9783540274773 _9978-3-540-27477-3
024	7		_a10.1007/3-540-27477-4 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
100	1		_aWegener, Ingo.
245	1	0	_aComplexity Theory _h[electronic resource] : _bExploring the Limits of Efficient Algorithms / _cby Ingo Wegener.
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005.
300			_bdigital.
650		0	_aComputer science.
650		0	_aCoding theory.
650		0	_aComputer software.
650		0	_aLogic design.
650		0	_aAlgorithms.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aCoding and Information Theory.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aAlgorithms.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540210450
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-27477-4
912			_aZDB-2-SCS
999			_c75609 _d75609