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
6
From page
8
To page
13
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