On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
RAIRO-Theor. Inf. Appl., 33 2 (1999) 103-115
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
Claude Carlet and Palash SarkarDiscrete Applied Mathematics 373 256 (2025)
https://doi.org/10.1016/j.dam.2025.05.004
On the cryptographic properties of weightwise affine and weightwise quadratic functions
Pierrick Méaux and Yassine OzaimDiscrete Applied Mathematics 355 13 (2024)
https://doi.org/10.1016/j.dam.2024.04.008
Timing-Aware Qubit Mapping and Gate Scheduling Adapted to Neutral Atom Quantum Computing
Yongshang Li, Yu Zhang, Mingyu Chen, Xiangyang Li and Peng XuIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 42 (11) 3768 (2023)
https://doi.org/10.1109/TCAD.2023.3261244
Efficient Ancilla-Free Reversible and Quantum Circuits for the Hidden Weighted Bit Function
Sergey Bravyi, Theodore J. Yoder and Dmitri MaslovIEEE Transactions on Computers 71 (5) 1170 (2022)
https://doi.org/10.1109/TC.2021.3076435
On CDCL-Based Proof Systems with the Ordered Decision Strategy
Nathan Mull, Shuo Pang and Alexander RazborovSIAM Journal on Computing 51 (4) 1368 (2022)
https://doi.org/10.1137/20M1362528
On Limitations of Structured (Deterministic) DNNFs
Beate Bollig and Matthias ButtkusTheory of Computing Systems 64 (5) 799 (2020)
https://doi.org/10.1007/s00224-019-09960-w
On Representing the Set of All Parse Trees with a Decision Diagram
Kei Amii, Masaaki Nishino and Akihiro YamamotoTransactions of the Japanese Society for Artificial Intelligence 34 (6) A-I34_1 (2019)
https://doi.org/10.1527/tjsai.A-I34
On the Relative Succinctness of Sentential Decision Diagrams
Beate Bollig and Matthias ButtkusTheory of Computing Systems 63 (6) 1250 (2019)
https://doi.org/10.1007/s00224-018-9904-z
191 (2017)
https://doi.org/10.1109/ISMVL.2017.54
Efficient implementation of generalized Maiorana–McFarland class of cryptographic functions
Enes Pasalic, Anupam Chattopadhyay and WeiGuo ZhangJournal of Cryptographic Engineering 7 (4) 287 (2017)
https://doi.org/10.1007/s13389-016-0139-0
On the second-order nonlinearity of the hidden weighted bit function
Qichun Wang and Chik How TanDiscrete Applied Mathematics 215 197 (2016)
https://doi.org/10.1016/j.dam.2016.06.020
Mathematical Foundations of Computer Science 2014
Beate BolligLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2014 8635 118 (2014)
https://doi.org/10.1007/978-3-662-44465-8_11
On efficient implicit OBDD-based algorithms for maximal matchings
Beate Bollig and Tobias PrögerInformation and Computation 239 29 (2014)
https://doi.org/10.1016/j.ic.2014.08.006
99 (2013)
https://doi.org/10.1109/NANO.2013.6721041
Priority functions for the approximation of the metric TSP
Beate Bollig and Michael CapelleInformation Processing Letters 113 (14-16) 584 (2013)
https://doi.org/10.1016/j.ipl.2013.05.002
Synthesis and optimization of reversible circuits—a survey
Mehdi Saeedi and Igor L. MarkovACM Computing Surveys 45 (2) 1 (2013)
https://doi.org/10.1145/2431211.2431220
63 (2012)
https://doi.org/10.1109/ISMVL.2012.49
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Beate BolligTheoretical Computer Science 447 2 (2012)
https://doi.org/10.1016/j.tcs.2011.11.029
Theoretical Computer Science
Beate BolligIFIP Advances in Information and Communication Technology, Theoretical Computer Science 323 286 (2010)
https://doi.org/10.1007/978-3-642-15240-5_21
Combinatorial Optimization and Applications
Beate BolligLecture Notes in Computer Science, Combinatorial Optimization and Applications 6509 16 (2010)
https://doi.org/10.1007/978-3-642-17461-2_2
Lower bounds on the OBDD size of two fundamental functions' graphs
Daniel SawitzkiInformation Processing Letters 101 (2) 66 (2007)
https://doi.org/10.1016/j.ipl.2006.08.004
79 (2001)
https://doi.org/10.1109/DSD.2001.952121
173 (2001)
https://doi.org/10.1109/ICVD.2001.902657