مرکز منطقه ای اطلاع رساني علوم و فناوري - On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain

Title of article :

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

Author/Authors :

Fuxiang Yu، نويسنده , , Arthur Chou ، نويسنده , , Ker-I Ko، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2006

Pages :

From page :

803

To page :

817

Keywords :

computational complexity , Np , Complexity theory of real functions , Circumscribed rectangles

Journal title :

Journal of Complexity

Serial Year :

2006

Journal title :

Journal of Complexity

Record number :

292111

Link To Document :