95 search results - page 6 / 19 » Improved Exact Algorithms for Counting 3- and 4-Colorings |
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
SI3D
1999
ACM
13 years 10 months ago
1999
ACM
Visibility computation and level of detail modeling are two important components of efficient scenerendering algorithms. Both aim to lessen the graphics load by lowering polygon c...
CP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
ISCAS
2005
IEEE
13 years 12 months ago
2005
IEEE
—This paper describes a clipping engine, which processes the view clipping, perspective division, and view-port mapping of 3D graphics. Complexity of polygon clipping algorithm c...
IWPEC
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...