Sciweavers

1857 search results - page 141 / 372
» Minimum Degree Orderings
Sort
View
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
15 years 10 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
15 years 10 months ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
15 years 10 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
15 years 6 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca