Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. M.J. Fischer, A.R. Meyer and M.S. Paterson. "Lower bounds on the size of Boolean formulas: preliminary report", Proc. 7th Ann. ACM Symp. on Th. of Computing (1975), 45–49.
2. L.H. Harper and J.E. Savage. "On the complexity of the marriage problem", Advances in Mathematics 9, 3 (1972), 299–312.
3. L. Hodes. "The logical complexity of geometric properties in the plane", J. ACM 17, 2 (1970), 339–347.
4. L. Hodes and E. Specker. "Lengths of formulas and elimination of quantifiers I", in Contributions to Mathematical Logic, K. Schutte, ed., North Holland Publ. Co., (1968), 175–188.
5. G. Hotz. "Untere Schranken für das Analyseproblem kontext-freier Sprachen", Techn. Bericht, Univ. des Saarlandes, 1976.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献