1278 search results - page 9 / 256 » The Complexity of Weighted Boolean |
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper concerns the open problem of Lov
WSCG
2004
13 years 9 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
ISLPED
1996
ACM
13 years 11 months ago
1996
ACM
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
IPL
2010
13 years 6 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
ESA
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef ...