|
|
|
|
| LEADER |
01685cam a22005417a 4500 |
| 001 |
BIBLO-32674 |
| 003 |
AR-BaUEN |
| 005 |
20250421113932.0 |
| 008 |
030701s1994 xxua|||f |||| 00| 0|eng|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 0201530821
|
| 044 |
|
|
|a xxu
|
| 080 |
|
|
|a 681.33
|
| 100 |
1 |
|
|a Papadimitriou, Christos H.
|
| 245 |
1 |
0 |
|a Computational complexity
|
| 260 |
|
|
|a Reading, MA :
|b Addison-Wesley,
|c 1994, reimpr. 1995
|
| 300 |
|
|
|a xv, 523 p. :
|b il.
|
| 500 |
|
|
|a INFOTECA: Ej.2
|
| 505 |
0 |
0 |
|g 1
|t Problems and Algorithms
|
| 505 |
0 |
0 |
|g 2
|t Turing machines
|
| 505 |
0 |
0 |
|g 3
|t Computability
|
| 505 |
0 |
0 |
|g 4
|t Boolean logic
|
| 505 |
0 |
0 |
|g 5
|t First-order logic
|
| 505 |
0 |
0 |
|g 6
|t Undecidability in logic
|
| 505 |
0 |
0 |
|g 7
|t Relations between complexity classes
|
| 505 |
0 |
0 |
|g 8
|t Reductions and completeness
|
| 505 |
0 |
0 |
|g 9
|t NP-complete problems
|
| 505 |
0 |
0 |
|g 10
|t coNP and function problems
|
| 505 |
0 |
0 |
|g 11
|t Randomized computation
|
| 505 |
0 |
0 |
|g 12
|t Cryptography
|
| 505 |
0 |
0 |
|g 13
|t Approximability
|
| 505 |
0 |
0 |
|g 14
|t On P vs. NP
|
| 505 |
0 |
0 |
|g 15
|t Parallel computation
|
| 505 |
0 |
0 |
|g 16
|t Logarithmic space
|
| 505 |
0 |
0 |
|g 17
|t The polynomial hierarchy
|
| 505 |
0 |
0 |
|g 18
|t Computation that counts
|
| 505 |
0 |
0 |
|g 19
|t Polynomial space
|
| 505 |
0 |
0 |
|g 20
|t A glimpse beyond
|
| 505 |
0 |
0 |
|t Index
|
| 505 |
0 |
0 |
|t Author index
|
| 653 |
1 |
0 |
|a ALGORITMOS
|
| 653 |
1 |
0 |
|a COMPLEJIDAD DE PROBLEMAS
|
| 653 |
1 |
0 |
|a MAQUINAS TURING
|
| 650 |
1 |
4 |
|a LOGICA COMPUTACIONAL
|
| 650 |
1 |
4 |
|a TEORIA DE LA COMPUTABILIDAD
|
| 650 |
1 |
7 |
|2 spines
|a CRIPTOGRAFIA
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|
| 999 |
|
|
|c 25430
|