Sciweavers

31 search results - page 2 / 7
» Constructing Ramsey Graphs from Boolean Function Representat...
Sort
View
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
15 years 3 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
BMCBI
2010
233views more  BMCBI 2010»
14 years 10 months ago
Odefy -- From discrete to continuous models
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
Jan Krumsiek, Sebastian Pölsterl, Dominik M. ...
ICCD
2002
IEEE
101views Hardware» more  ICCD 2002»
15 years 6 months ago
Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
SAT
2009
Springer
109views Hardware» more  SAT 2009»
15 years 4 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
DCC
2008
IEEE
15 years 9 months ago
From graph states to two-graph states
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
Constanza Riera, Stéphane Jacob, Matthew G. Parke...