1220 search results - page 6 / 244 » Minimal Interval Completions |
CPM
2008
Springer
13 years 9 months ago
2008
Springer
ISMVL
2010
IEEE
13 years 12 months ago
2010
IEEE
We study intervals I(A) of partial clones whose total functions constitute a (total) clone A. In the Boolean case, we provide a complete classification of such intervals (accordin...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
CRYPTO
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
DDECS
2008
IEEE
14 years 2 months ago
2008
IEEE
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...