Arthur W. Chou

发表

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

Ker-I Ko, Arthur W. Chou, 2005, Electron. Notes Theor. Comput. Sci..

The computational complexity of distance functions of two-dimensional domains

Ker-I Ko, Arthur W. Chou, 2005, Theor. Comput. Sci..

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

Ker-I Ko, Arthur W. Chou, 2004, Math. Log. Q..

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

Ker-I Ko, Fuxiang Yu, Arthur W. Chou, 2006, J. Complex..

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

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

On the optimality of Krylov information

Arthur W. Chou, 1987, J. Complex..

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

Ker-I Ko, Arthur W. Chou, 1993, STOC '93.

Computational Complexity of Two-Dimensional Regions

Ker-I Ko, Arthur W. Chou, 1995, SIAM J. Comput..

Some Complexity Issues in Complex Analysis ( Extended Abstract for CCA 96 )

Arthur W. Chou, 1995 .

The Dirac operator on spaces with conical singularities and positive scalar curvatures

Arthur W. Chou, 1985 .