1204 search results - page 101 / 241 » Termination of Polynomial Programs |
ESOP
2006
Springer
15 years 4 months ago
2006
Springer
We design a schema language that includes channel schemas with capabilities of input, output, and input-output. These schemas may describe documents containing references to operat...
104
Voted
ORL
1998
15 years 11 days 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...
134
click to vote
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
123
click to vote
SWAT
2010
Springer
14 years 10 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
SIGCSE
2009
ACM
16 years 1 months ago
2009
ACM
Dynamic memory management and the use of pointers are critical topics in teaching the C++ language. They are also some of the most difficult for students to grasp properly. The re...