000			04678nam a22003855i 4500
001			286752
003			MX-SnUAN
005			20160429154515.0
007			cr nn 008mamaa
008			150903s2013 xxk| o |||| 0|eng d
020			_a9781447155591 _99781447155591
024	7		_a10.1007/9781447155591 _2doi
035			_avtls000340131
039		9	_a201509030313 _bVLOAD _c201404300411 _dVLOAD _y201402061017 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aDowney, Rodney G. _eautor _9304695
245	1	0	_aFundamentals of Parameterized Complexity / _cby Rodney G. Downey, Michael R. Fellows.
264		1	_aLondon : _bSpringer London : _bImprint: Springer, _c2013.
300			_axxx, 763 páginas 83 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
490	0		_aTexts in Computer Science, _x1868-0941
500			_aSpringer eBooks
505	0		_aIntroduction -- Part I: Parameterized Tractability -- Preliminaries -- The Basic Definitions -- Part II: Elementary Positive Techniques -- Bounded Search Trees -- Kernelization -- More on Kernelization -- Iterative Compression, and Measure and Conquer, for Minimization Problems -- Further Elementary Techniques -- Colour Coding, Multilinear Detection, and Randomized Divide and Conquer -- Optimization Problems, Approximation Schemes, and Their Relation to FPT -- Part III: Techniques Based on Graph Structure -- Treewidth and Dynamic Programming -- Heuristics for Treewidth -- Automata and Bounded Treewidth -- Courcelle's Theorem -- More on Width-Metrics: Applications and Local Treewidth -- Depth-First Search and the Plehn-Voigt Theorem -- Other Width Metrics -- Part IV: Exotic Meta-Techniques -- Well-Quasi-Orderings and the Robertson-Seymour Theorems -- The Graph Minor Theorem -- Applications of the Obstruction Principle and WQOs -- Part V: Hardness Theory -- Reductions -- The Basic Class W[1] and an Analog of Cook's Theorem -- Other Hardness Results -- The W-Hierarchy -- The Monotone and Antimonotone Collapses -- Beyond W-Hardness -- k-Move Games -- Provable Intractability: The Class XP -- Another Basis -- Part VI: Approximations, Connections, Lower Bounds -- The M-Hierarchy, and XP-optimality -- Kernelization Lower Bounds -- Part VII: Further Topics -- Parameterized Approximation -- Parameterized Counting and Randomization -- Part VIII: Research Horizons -- Research Horizons -- Part IX Appendices -- Appendix 1: Network Flows and Matchings -- Appendix 2: Menger's Theorems.
520			_aThe field of parameterized complexity/multivariate complexity algorithmics is an exciting and vibrant part of theoretical computer science, responding to the vital need for efficient algorithms in modern society. This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research. Topics and features: Describes many of the standard algorithmic techniques available for establishing parametric tractability Reviews the classical hardness classes Explores the various limitations and relaxations of the methods Showcases the powerful new lower bound techniques Examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach Demonstrates how complexity methods and ideas have evolved over the past 25 years This classroom-tested and easy-to-follow textbook/reference is essential reading for the beginning graduate student and advanced undergraduate student. The book will also serve as an invaluable resource for the general computer scientist and the mathematically-aware scientist seeking tools for their research.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aFellows, Michael R. _eautor _9315590
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9781447155584
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-4471-5559-1 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c286752 _d286752