Resultats globals: 1 registres trobats en 0.02 segons.
Documents de recerca, 1 registres trobats
Documents de recerca 1 registres trobats  
1.
11 p, 182.8 KB Consistency and optimality / Chen, Yijia ; Flum, Jörg ; Müller, Moritz ; Centre de Recerca Matemàtica
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. [...]
Centre de Recerca Matemàtica 2011 (Prepublicacions del Centre de Recerca Matemàtica ; 1014)  

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.