مرکز منطقه ای اطلاع رساني علوم و فناوري - Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope

Title of article :

Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope

Author/Authors :

Ioannis Koutis، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2006

Pages :

From page :

To page :

Keywords :

computational complexity , Inapproximability , Parameterized computation , Computational geometry

Journal title :

Information Processing Letters

Serial Year :

2006

Journal title :

Information Processing Letters

Record number :

130307

Link To Document :