article

Graph driven BDDs—a new data structure for Boolean functions

Authors:

Detlef Sieling,

Ingo WegenerAuthors Info & Claims

Theoretical Computer Science, Volume 141, Issue 1-2

Pages 283 - 310

https://doi.org/10.1016/0304-3975(94)00078-W

Published: 17 April 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Bollig BButtkus M(2019)On the Relative Succinctness of Sentential Decision DiagramsTheory of Computing Systems10.1007/s00224-018-9904-z63:6(1250-1277)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s00224-018-9904-z
Jha ASuciu DMilo T(2011)Knowledge compilation meets database theoryProceedings of the 14th International Conference on Database Theory10.1145/1938551.1938574(162-173)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1938551.1938574
Sewe ABockisch CMezini MClifton C(2008)Redundancy-free residual dispatchProceedings of the 7th workshop on Foundations of aspect-oriented languages10.1145/1394496.1394497(1-7)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1145/1394496.1394497
Show More Cited By

Index Terms

Graph driven BDDs—a new data structure for Boolean functions

Recommendations

Graph Functions of Boolean Functions

We introduce and characterize those Boolean functions (graph functions) which can be regarded as characteristic functions of graphs of other Boolean functions. An algorithm for detecting these functions is also presented. Finally, we discuss the ...
Boolean functions with two distinct Walsh coefficients

Are there other Boolean functions having two distinct Walsh coefficients except affine Boolean functions and maximal nonlinear (i.e. bent) Boolean functions__ __ This paper proves that all Boolean functions with exactly two distinct Walsh coefficients ...
On the Symmetric Negabent Boolean Functions
INDOCRYPT '09: Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology

We study the negabent Boolean functions which are symmetric. The Boolean function which has equal absolute spectral values under the nega-Hadamard transform is called a negabent function. For a bent function, the absolute spectral values are the same ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 141, Issue 1-2

April 17, 1995

344 pages

ISSN:0304-3975

Editor:
M. Nivat
Univ. de Paris VII, Moiselles, France

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 17 April 1995

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bollig BButtkus M(2019)On the Relative Succinctness of Sentential Decision DiagramsTheory of Computing Systems10.1007/s00224-018-9904-z63:6(1250-1277)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s00224-018-9904-z
Jha ASuciu DMilo T(2011)Knowledge compilation meets database theoryProceedings of the 14th International Conference on Database Theory10.1145/1938551.1938574(162-173)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1938551.1938574
Sewe ABockisch CMezini MClifton C(2008)Redundancy-free residual dispatchProceedings of the 7th workshop on Foundations of aspect-oriented languages10.1145/1394496.1394497(1-7)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1145/1394496.1394497
Gu TLiu H(2008)The symbolic OBDD scheme for generating mechanical assembly sequencesFormal Methods in System Design10.1007/s10703-008-0052-y33:1-3(29-44)Online publication date: 1-Dec-2008
https://dl.acm.org/doi/10.1007/s10703-008-0052-y
Gherman VWunderlich HMascarenhas RSchloeffel JGarbers MZhou HMacii EYan ZMassoud Y(2007)Synthesis of irregular combinational functions with large don't care setsProceedings of the 17th ACM Great Lakes symposium on VLSI10.1145/1228784.1228856(287-292)Online publication date: 11-Mar-2007
https://dl.acm.org/doi/10.1145/1228784.1228856
Bollig BWaack SWoelfel P(2006)Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplicationTheoretical Computer Science10.1016/j.tcs.2006.05.035362:1(86-99)Online publication date: 11-Oct-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.05.035
Homeister M(2006)Lower bounds for restricted read-once parity branching programsTheoretical Computer Science10.1016/j.tcs.2006.01.052359:1(1-14)Online publication date: 14-Aug-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.01.052
Murray NRosenthal E(2005)Efficient query processing with compiled knowledge basesProceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods10.1007/11554554_18(231-244)Online publication date: 14-Sep-2005
https://dl.acm.org/doi/10.1007/11554554_18
Wegener I(2004)BDDs-design, analysis, complexity, and applicationsDiscrete Applied Mathematics10.5555/1704845.1705111138:1-2(229-251)Online publication date: 1-Mar-2004
https://dl.acm.org/doi/10.5555/1704845.1705111
Bollig B(2003)Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching ProgramsProceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science10.5555/646517.696340(295-306)Online publication date: 27-Feb-2003
https://dl.acm.org/doi/10.5555/646517.696340
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Graph Functions of Boolean Functions

Boolean functions with two distinct Walsh coefficients

On the Symmetric Negabent Boolean Functions

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations