933 search results - page 34 / 187 » Monotone Complexity of a Pair |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
SMA
2005
ACM
14 years 1 months ago
2005
ACM
We present an algorithm for generating the Voronoi cells for a set of rational C1 -continuous planar closed curves, which is precise up to machine precision. Initially, bisectors ...
FC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...
CAEPIA
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. Multi-adjoint logic programs were recently proposed as a generalization of monotonic and residuated logic programs, in that simultaneous use of several implications in th...