<F3.746e+05> L.<F3.852e+05> Khachiyan,<F3.712e+05> On the complexity of approximating determinants in<F3.852e+05> matrices, J. Complexity, 11 (1995), pp. 138--153. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
New Lower Bounds for Convex Hull Problems in Odd Dimensions - Erickson (1999) (9 citations) (Correct)
....section of the paper, we derive such lower bounds directly. Remark. If r is not fixed, the problem rsum is NP complete, by a simple reduction to Subset Sum [28] We can use this fact to give simple proofs that certain geometric problems in arbitrary dimensions are NP hard. For example, Khachiyan [33] proves that detecting a#ne degeneracies is NP complete. This result follows directly from Lemma 2.1. Chandrasekaran, Kabadi, and Murty [14] and Dyer [19] independently prove that deciding whether the convex hull of a set of points is simplicial is coNP complete; this result also follows ....
<F3.746e+05> L.<F3.852e+05> Khachiyan,<F3.712e+05> On the complexity of approximating determinants in<F3.852e+05> matrices, J. Complexity, 11 (1995), pp. 138--153.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC