On the measure of two-dimensional regions with polynomial-time computable boundaries

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1996, Pages 150-159

  Ko, Ker I ^a   Weihrauch, Klaus ^a  

^a Dep of Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; ERRORS; FUNCTIONS; POLYNOMIALS; RECURSIVE FUNCTIONS; TURING MACHINES;

COMPUTABILITY; INTERIOR REGION; JORDAN CURVES; LEBESGUE MEASURE; ORACLE MACHINE; POLYNOMIAL TIME COMPUTABLE BOUNDARY; TWO DIMENSIONAL REGIONS;

COMPUTATION THEORY;

EID: 0029694620     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)