Sciweavers

707 search results - page 118 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
EUROCRYPT
1999
Springer
14 years 5 days ago
S-boxes with Controllable Nonlinearity
Abstract. In this paper, we give some relationship between the nonlinearity of rational functions over F2n and the number of points of associated hyperelliptic curve. Using this, w...
Jung Hee Cheon, Seongtaek Chee, Choonsik Park
DAC
1997
ACM
14 years 3 days ago
Safe BDD Minimization Using Don't Cares
In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algor...
Youpyo Hong, Peter A. Beerel, Jerry R. Burch, Kenn...
CCL
1994
Springer
14 years 11 hour ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 10 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
VMV
2003
154views Visualization» more  VMV 2003»
13 years 9 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt