Oct 1, 2004 · The computational complexity of finding a shortest path in a two-dimensional domain is studied in the Turing machine-based computational ...

The problem of finding a piecewise straight-line path, with a constant number of line segments, in a two-dimensional domain is studied in the Turing ...

The computational complexity of finding a shortest path in a two-dimensional domain is studied in the Turing machine-based computational model and in the ...

Oct 22, 2024 · The computational complexity of finding a shortest path in a two-dimensional domain is studied in the Turing machine-based computational ...

It is proved that the shortest path problem has the polynomial‐space upper bound for domains of both type (A) and type (B); and it has a polynometric‐space ...

内容：. This talk consists of two parts. In the first part, we present an overview of the complexity theory of real-valued functions, which studies the ...

Chou and K. Ko, On the complexity of finding paths in a two-dimensional domain I: shortest paths, Math. Logic Quarterly, 50 (2004) ...

The computational complexity of finding a shortest path in a two-dimensional domain is studied in the Turing machine-based computational model and in the ...

TL;DR: This paper focuses on the problems of computing single-valued, analytic branches of the logarithm and square root functions on a bounded, simply ...

The problem of finding a piecewise straight-line path, with a constant number of line segments, in a two-dimensional domain is studied in the Turing ...