TY  - THES
AU  - Parrilla Sánchez, Antonio
A3  - Rodríguez Laguna, Ismael
PY  - 2025
UR  - https://hdl.handle.net/20.500.14352/124108
AB  - Since the discovery of NP-completeness in 1972, many researchers have focused on the possibility of efficiently computing approximate solutions to NP-hard optimization problems. Researchers noticed that even when restricting ourselves to NP-hard...
AB  - Desde que se descubrió la NP-completitud en 1972, muchos investigadores se han centrado en la posibilidad de calcular de forma eficiente soluciones aproximadas aproblemas de optimización NP-duros. Los investigadores se dieron cuenta de que, incluso...
LA  - eng
KW  - PCP theorem
KW  - NP-complete
KW  - NP-hard
KW  - Low degree testing
KW  - Complexity
KW  - Locally testable proof systems
KW  - Teorema PCP
KW  - NP-completo
KW  - NP-duro
KW  - Aproximación
KW  - Tests de bajo grado
KW  - Complejidad
KW  - Demostradores testeables localmente
TI  - Explanation (as friendly as possible) of the PCP  theorem and its proof
M3  - bachelor thesis
ER  -