Conference Papers
Year : 1994
Jean Goubault-Larrecq : Connect in order to contact the contributor
https://inria.hal.science/hal-03243514
Submitted on : Monday, May 31, 2021-4:23:24 PM
Last modification on : Monday, May 31, 2021-4:23:25 PM
Cite
Jean Goubault. The complexity of resource-bounded first-order classical logic. Annual Symposium on Theoretical Aspects of Computer Science, Feb 1994, Caen, France. pp.59-70, ⟨10.1007/3-540-57785-8_131⟩. ⟨hal-03243514⟩
8
View
0
Download