Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Bentley, J.L., Ottmann, T., The complexity of manipulating hierarchically defined sets of rectangles, MFCS 1981, in Lecture Notes in Computer Science 118, 1–15.
2. Garey, M.R., Johnson, D.S., Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco 1979.
3. Jones, N.D., Lien, Y.E., Laaser, W.T., New problems complete for nondeterministic log space, Mathematical Systems Theory 10(1976), 1–17.
4. Jones, N.D., Space-bounded reducibility among combinatorial problems, Journal of Computer and System Sciences 11(1975), 68–85.
5. Meyer, A.R., Stockmeyer, L.J., The equivalence problem for regular expressions with squaring requires exponential space, Proc. of the 13th SWAT (1972), 125–129.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献