7106 search results - page 72 / 1422 » Restricted Complexity, General Complexity |
ORL
1998
13 years 7 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
We propose a method that uses the restricted inter-view prediction for multi-view video coding. In the multi-view video, there exists occluded area because of the locations and an...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
RECOMB
2009
Springer
14 years 8 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...