95 search results - page 12 / 19 » Improved Exact Algorithms for Counting 3- and 4-Colorings |
ASPLOS
2009
ACM
14 years 8 months ago
2009
ACM
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...
PKC
2004
Springer
14 years 24 days ago
2004
Springer
The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny f...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
DISOPT
2008
13 years 7 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...