Arthur W. Chou

According to our database, Arthur W. Chou authored at least 8 papers between 1987 and 2006.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2006

On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain.

Fuxiang Yu, Arthur W. Chou, Ker-I Ko

J. Complex., 2006

2005

The computational complexity of distance functions of two-dimensional domains.

Arthur W. Chou, Ker-I Ko

Theor. Comput. Sci., 2005

On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain.

Fuxiang Yu, Arthur W. Chou, Ker-I Ko

Proceedings of the CCA 2005, 2005

2004

On the complexity of finding paths in a two-dimensional domain I: Shortest paths.

Arthur W. Chou, Ker-I Ko

Math. Log. Q., 2004

On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths.

Arthur W. Chou, Ker-I Ko

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

1995

Computational Complexity of Two-Dimensional Regions.

Arthur W. Chou, Ker-I Ko

SIAM J. Comput., 1995

1993

Some complexity issues on the simply connected regions of the two-dimensional plane.

Arthur W. Chou, Ker-I Ko

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1987

On the optimality of Krylov information.

Arthur W. Chou

J. Complex., 1987