|
Title:
|
Consistency and optimality
|
|
Author:
|
Chen, Yijia; Flum, Jörg; Müller, Moritz
|
|
Other authors:
|
Centre de Recerca Matemàtica |
|
Resum:
|
Assume that the problem Qo is not solvable in polynomial time. For theories T containing a sufficiently rich part of true arithmetic we characterize T U {ConT} as the minimal extension of T proving for some algorithm that it decides Qo as fast as any algorithm B with the property that T proves that B decides Qo. Here, ConT claims the consistency of T. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories. |
|
Publication date:
|
2011 |
|
Subject (UDC):
|
510 - Consideracions fonamentals i generals de les matemàtiques |
|
Subject(s):
|
Conjunts, Teoria de
Complexitat de càlcul |
|
Rights:
|
Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat i el centre i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús (http://creativecommons.org/licenses/by-nc-nd/2.5/es/) |
|
Document type:
|
Preprint |
|
Share:
|
|
