K. Compton (compton-k)
Contributions à Philosophie.ch
No contributions yet
Bibliography
Compton, K. and Ward Henson, C. 2000. “A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories.” in Handbook of Logic in Computer Science. Volume 5. Logic and Algebraic Methods, edited by Samson Abramsky, Dov M. Gabbay, and Thomas S. E. Maibaum, pp. 129–215. Oxford: Oxford University Press.