1469 search results - page 157 / 294 » Approximate polynomial decomposition |
156
click to vote
DAM
2006
15 years 6 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
139
Voted
ALGORITHMICA
2004
15 years 6 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
144
click to vote
MOC
2010
15 years 28 days ago
2010
Hill's method is a means to numerically approximate spectra of linear differential operators with periodic coefficients. In this paper, we address different issues related to...
196
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
163
Voted
FOCS
2008
IEEE
16 years 18 days ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...