Subject
Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics
Reference19 articles.
1. M. Braverman, Hyperbolic Julia sets are poly-time computable, Proceedings of the Sixth Workshop on Computability and Complexity in Analysis 2004, Electronic Notes in Theoretical Computer Science, vol. 120, Elsevier, Amsterdam, 2005, pp. 17–30.
2. M. Braverman, M. Yampolsky, Non-computable julia sets, CoRR, math.DS/0406416 〈http://arxiv.org/abs/math/0406416〉, 2004.
3. Computational complexity of two-dimensional regions;Chou;SIAM. J. Comput.,1995
4. On the complexity of finding paths in a two-dimensional domain I: shortest paths;Chou;Math. Logic Quart.,2004
5. A. W. Chou, K. Ko, On the complexity of finding paths in a two-dimensional domain II: piecewise straight-line paths, Proceedings of the Sixth Workshop on Computability and Complexity in Analysis 2004, Electronic Notes in Theoretical Computer Science, vol. 120, Elsevier, Amsterdam, 2005, pp. 45–57.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Square Root Computation–An Analysis;Lecture Notes in Electrical Engineering;2022
2. In Memoriam: Ker-I Ko (1950–2018);Complexity and Approximation;2020
3. Low-Complexity Methodology for Complex Square-Root Computation;IEEE Transactions on Very Large Scale Integration (VLSI) Systems;2017-11
4. Jordan Areas and Grids;Electronic Notes in Theoretical Computer Science;2008-12
5. On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane;Electronic Notes in Theoretical Computer Science;2008-03