000			02901nam a22003615i 4500
001			294455
003			MX-SnUAN
005			20160429155146.0
007			cr nn 008mamaa
008			150903s2005 gw | o |||| 0|eng d
020			_a9783540274773 _99783540274773
024	7		_a10.1007/3540274774 _2doi
035			_avtls000346969
039		9	_a201509030743 _bVLOAD _c201404121309 _dVLOAD _c201404091046 _dVLOAD _y201402070920 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aWegener, Ingo. _eautor _9328040
245	1	0	_aComplexity Theory : _bExploring the Limits of Efficient Algorithms / _cby Ingo Wegener.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005.
300			_axii, 308 páginas 31 ilustraciones _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
500			_aSpringer eBooks
505	0		_aAlgorithmic Problems & Their Complexity -- Fundamental Complexity Classes -- Reductions — Algorithmic Relationships Between Problems -- The Theory of NP-Completeness -- NP-complete and NP-equivalent Problems -- The Complexity Analysis of Problems -- The Complexity of Approximation Problems — Classical Results -- The Complexity of Black Box Problems -- Additional Complexity Classes and Relationships Between Complexity Classes -- Interactive Proofs -- The PCP Theorem and the Complexity of Approximation Problems -- Further Topics From Classical Complexity Theory -- The Complexity of Non-uniform Problems -- Communication Complexity -- The Complexity of Boolean Functions.
520			_aComplexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540210450
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/3-540-27477-4 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c294455 _d294455