128 search results - page 4 / 26 » Representation and Complexity in Boolean Games |
WSCG
2004
14 years 6 days 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...
ICANN
2003
Springer
14 years 4 months ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
ICCAD
1996
IEEE
14 years 3 months ago
1996
IEEE
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...
SMA
2005
ACM
14 years 4 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
SIAMCOMP
2011
13 years 5 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...