|
|
|
|
| LEADER |
00000nam a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250311170216.0 |
| 008 |
230201s1994 xxua r 000 0 eng d |
| 020 |
|
|
|a 0139153802
|
| 024 |
8 |
|
|a DIF-M1706
|b 1776
|z DIF001649
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Bovet, Daniel Pierre
|
| 245 |
1 |
0 |
|a Introduction to the theory of complexity
|
| 260 |
|
|
|a Nueva York :
|b [S.n.],
|c c1994
|
| 300 |
|
|
|a xi, 282 p. : il. ;
|c 24 cm.
|
| 490 |
0 |
|
|a International series in computer science
|
| 500 |
|
|
|a Incluye bibliografía. --
|
| 505 |
0 |
|
|a Mathematical preliminaries -- Elements of computability theory -- Complexity classes -- The class P -- The class NP -- The complexity of optimization problems -- Beyond NP -- Space-complexity classes -- Probabilistic algorithms and complexity classes -- Interactive proof systems -- Models of parallel computers -- Parallel algorithms.
|
| 650 |
|
4 |
|a TEORÍA DE LA COMPUTABILIDAD
|
| 650 |
|
4 |
|a COMPLEJIDAD COMPUTACIONAL
|
| 650 |
|
4 |
|a ALGORITMOS PARALELOS
|
| 700 |
1 |
|
|a Crescenzi, Pierluigi
|
| 942 |
|
|
|c BK
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 F2_BOV
|7 0
|9 75376
|a DIF
|b DIF
|d 2006-08-23
|i DIF-00386
|l 0
|o F.2 BOV
|p DIF-00386
|r 2025-03-11 17:02:16
|w 2025-03-11
|y BK
|
| 999 |
|
|
|c 51574
|d 51574
|
