14 search results - page 1 / 3 » Bounds on the size of branch-and-bound proofs for integer kn... |
ORL
2008
13 years 4 months ago
2008
POPL
2012
ACM
12 years 9 days ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
ISAAC
1992
Springer
13 years 8 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
IPL
2007
13 years 4 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
TIT
2011
12 years 11 months ago
2011
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...