|
|||||
|
|
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain |
|
| Authors: | Fuxiang Yu Arthur Chou Ker-I Ko |
| Institution: | aDepartment of Computer Science, State University of New York at Stony Brook, Stony Brook, NY 11794, USA;bDepartment of Mathematics and Computer Science, Clark University, Worcester, MA 01610, USA |
| Abstract: | |
| Keywords: | Computational complexity NP Circumscribed rectangles Complexity theory of real functions |
| 本文献已被 ScienceDirect 等数据库收录！ | |