Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity
- 30 November 1984
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 27 (3) , 265-273
- https://doi.org/10.1016/0168-0072(84)90029-0
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A lower bound for the complexity of Craig's interpolants in sentential logicArchive for Mathematical Logic, 1983
- Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space ImplementationsSIAM Journal on Computing, 1982
- Complexity problems in computational theoryRussian Mathematical Surveys, 1981
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975
- Applications of many-sorted interpolation theoremsPublished by American Mathematical Society (AMS) ,1974