753 search results - page 30 / 151 » Completing a (k - 1)-Assignment |
JSC
2008
14 years 9 months ago
2008
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
MP
2006
14 years 9 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
SIAMDM
2008
14 years 9 months ago
2008
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
IJCM
2002
14 years 9 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
129
click to vote
DAC
2006
ACM
15 years 10 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...