Kevin J. Compton, C. Ward Henson. A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. Annals of Pure and Applied Logic, 48(1):1-79, 1990.
@article{ComptonH90,
title = {A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories},
author = {Kevin J. Compton and C. Ward Henson},
year = {1990},
tags = {C++},
researchr = {https://researchr.org/publication/ComptonH90},
cites = {0},
citedby = {0},
journal = {Annals of Pure and Applied Logic},
volume = {48},
number = {1},
pages = {1-79},
}