9842 search results - page 1357 / 1969 » The Complexity of the Matching-Cut Problem |
191
click to vote
DATE
1999
IEEE
15 years 11 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
214
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...
201
click to vote
CONCUR
1999
Springer
15 years 11 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
221
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
192
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...