696 search results - page 96 / 140 » A class of combinatorial identities |
175
click to vote
FMCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Formal methods, in particular model checking, are increasingly accepted as integral part of system development. With large software systems beyond the range of fully auto...
158
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
197
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
157
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
147
click to vote
RANDOM
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...