|
|
|
|
| LEADER |
00000nam a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250311170227.0 |
| 008 |
230201s1995 xxua r 000 0 eng d |
| 020 |
|
|
|a 0201530821
|
| 024 |
8 |
|
|a DIF-M2033
|b 2113
|z DIF001937
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Papadimitriou, Christos H.
|
| 245 |
1 |
0 |
|a Computational complexity
|
| 250 |
|
|
|a Repr. with corr. ed.
|
| 260 |
|
|
|a Reading :
|b [S.n.],
|c 1995
|
| 300 |
|
|
|a xv, 523 p. : il. ;
|c 24 cm.
|
| 505 |
0 |
|
|a Part I. Algorithms. 1. Problems and algorithms -- 2. Turing machines -- 3. Computability -- Part II. Logic. 4. Boolean logic -- 5. First-order logic -- 6. Undecidability in logic -- Part III. P and NP. 7. Relations between complexity classes -- 8. Reductions and completeness -- 9. NP-complete problems -- 10. coNP and fuction problems -- 11. Randomized computation -- 12. Cryptography -- 13. Approximability -- 14. One P vs NP -- Part IV. Inside P. 15. Parallel computation -- 16. Logarithmic space -- Part V. Beyond NP. 18. Computation that counts -- 19. Polynomial space -- 20. A glimpse beyond.
|
| 650 |
|
4 |
|a COMPLEJIDAD COMPUTACIONAL
|
| 942 |
|
|
|c BK
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 F2_PAP
|7 0
|9 75963
|a DIF
|b DIF
|d 2007-05-15
|i DIF-02888
|l 0
|o F.2 PAP
|p DIF-02888
|r 2025-03-11 17:02:27
|w 2025-03-11
|y BK
|
| 999 |
|
|
|c 51845
|d 51845
|
