738 search results - page 32 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
MICS
2010
14 years 8 months ago
2010
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
IACR
2011
13 years 9 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
CANDC
2009
ACM
15 years 4 months ago
2009
ACM
While algorithms have existed in math, music and other fields for over one thousand years, the use of algorithms to solve problems has become easier than ever before due to the a...
DAC
1989
ACM
15 years 1 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...