The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 24 NO.5 / (1995))
Computational Complexity of Two-Dimnsional Regions
Arthur W. Chou, Ker-I Ko,
Pages. 923-947
Abstract
Contents 1. Introduction
2. Preliminaries
2.1. Notation and terminology
2.2. Complexity classes
2.3. Computational model for real functions
3. Polynomial-time recognizable sets
4. Strongly P-recognizable sets
5. Zeros of polynomial-time computable functions
6. Winding numbers
7. The membership problem
8. The distance between a point a curve
9. The area of a region
Key words computational complexity, polynomial time, simply closed curves, winding numbers.
Mathmatical Subject Classification 68Q05, 68Q15