3415 search results - page 2 / 683 » Lower bounds on kernelization |
102
Voted
CORR
2010
Springer
15 years 2 days ago
2010
Springer
116
Voted
DISOPT
2011
14 years 10 months ago
2011
154
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
160
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
107
click to vote
RT
1995
Springer
15 years 7 months ago
1995
Springer
We present a simple and inexpensive method for computing the estimates of error in a hierarchical linear radiosity method. Similar to the approach used in 1 for constant radiosity ...