Výsledky vyhledávání - Boolean function enumeration

METHOD FOR MINIMIZATION OF BOOLEAN FUNCTIONS WITH A LARGE NUMBER OF VARIABLES BASED ON DIRECTED ENUMERATION

Zdroj: Bulletin of Cherkasy State Technological University; No. 1 (2023): Bulletin of Cherkasy State Technological University; 42-51
Вестник Черкасского государственного технологического университета; № 1 (2023): Вісник Черкаського державного технологічного університету; 42-51
Вісник Черкаського державного технологічного університету; № 1 (2023): Вісник Черкаського державного технологічного університету; 42-51
urn:2306:44551.2023

Témata: method of minimization, метод мінімізації, набір значень функції, set of function values, Boolean functions, directed enumeration, булеві функції, направлений перебір

Popis souboru: application/pdf

Přístupová URL adresa: http://vtn.chdtu.edu.ua/article/view/274914

METHOD FOR MINIMIZATION OF BOOLEAN FUNCTIONS WITH A LARGE NUMBER OF VARIABLES BASED ON DIRECTED ENUMERATION

Zdroj: Bulletin of Cherkasy State Technological University; No. 1 (2023): Bulletin of Cherkasy State Technological University; 42-51
Вестник Черкасского государственного технологического университета; № 1 (2023): Вісник Черкаського державного технологічного університету; 42-51
Вісник Черкаського державного технологічного університету; № 1 (2023): Вісник Черкаського державного технологічного університету; 42-51
urn:2306:44551.2023

Témata: method of minimization, метод мінімізації, набір значень функції, set of function values, Boolean functions, directed enumeration, булеві функції, направлений перебір

Popis souboru: application/pdf

Přístupová URL adresa: http://vtn.chdtu.edu.ua/article/view/274914

Topological equivalence classification and enumeration of n-input linearly separable Boolean functions: Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions

Autoři: Qinbin He Fangyue Chen Wei Jin

Zdroj: Information Sciences. 658:120020

Témata: inseparable factor, Switching theory, applications of Boolean algebras to circuits and networks, Learning and adaptive systems in artificial intelligence, conformal transformation, minimal subsystem, Neural networks for/in biological studies, artificial life and related topics, balanced linearly separable Boolean function, topological equivalence

Popis souboru: application/xml

Stratification and enumeration of Boolean functions by canalizing depth

Autoři: Qijun He Matthew Macauley

Zdroj: Physica D: Nonlinear Phenomena. 314:1-8

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Enumeration, Extended monomial layer, Nested canalizing function, FOS: Physical sciences, 01 natural sciences, Biological Physics (physics.bio-ph), Boolean function, 0103 physical sciences, FOS: Mathematics, Mathematics - Combinatorics, Canalizing depth, Physics - Biological Physics, Combinatorics (math.CO), Canalizing function, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://manuscript.elsevier.com/S016727891500189X/pdf/S016727891500189X.pdf
http://arxiv.org/abs/1504.07591
https://tigerprints.clemson.edu/cgi/viewcontent.cgi?article=1453&context=physastro_pubs
https://tigerprints.clemson.edu/physastro_pubs/454/
http://ui.adsabs.harvard.edu/abs/2016PhyD..314....1H/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1504.html#HeM15
https://www.sciencedirect.com/science/article/pii/S016727891500189X
https://arxiv.org/abs/1504.07591

Attractor detection and enumeration algorithms for Boolean networks

Autoři: Mori, Tomoya Akutsu, Tatsuya 森, 智弥 a další

Přispěvatelé: Mori, Tomoya Akutsu, Tatsuya 森, 智弥 a další

Zdroj: Comput Struct Biotechnol J
Computational and Structural Biotechnology Journal, Vol 20, Iss, Pp 2512-2520 (2022)

Témata: Computational complexity, 0301 basic medicine, 03 medical and health sciences, Nested canalyzing function, Singleton attractor, Mini Review, 0206 medical engineering, Boolean network, SAT, 02 engineering and technology, Periodic attractor, TP248.13-248.65, Biotechnology

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/35685366
https://doaj.org/article/0a3ae2ef4ef3417cbdaa954296269564

Asymptotic enumeration of correlation-immune boolean functions

Autoři: Canfield, E Rodney Gao, Zhicheng Greenhill, Catherine a další

Zdroj: Cryptography and Communications. 2:111-126

Témata: Correlation-immune, 05A16, Boolean function, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Keywords: Asymptotic enumeration, Combinatorics (math.CO), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Resilient

Přístupová URL adresa: http://arxiv.org/pdf/0909.3321
http://arxiv.org/abs/0909.3321

Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy

Autoři: Kazuyuki Amano

Zdroj: 2017 IEEE International Symposium on Information Theory (ISIT). :251-255

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Analyzing capacitated networks via Boolean-based coherent pseudo-Boolean functions

Autoři: Ali Muhammad Ali Rushdi Omar Mutab Alsalami

Zdroj: Network Biology, Vol 11, Iss 2, Pp 97-124 (2021)

Témata: capacitated networks, map method, max-flow min-cut theorem, pseudo-boolean function, probability-ready expression, exhaustive enumeration, inclusion-exclusion, Biology (General), QH301-705.5

Popis souboru: electronic resource

Relation: http://www.iaees.org/publications/journals/nb/articles/2021-11(2)/capacitated-networks.pdf; https://doaj.org/toc/2220-8879

Přístupová URL adresa: https://doaj.org/article/bfab7a88a66b438fb3a1dd995cb7c341

Distribution of The Boolean Functions of n Variables According to Their Algebraic Degrees

Autoři: Bakoev, Valentin

Zdroj: Serdica Journal of Computing. 13:17-26

Témata: Boolean Function, Algebraic Degree, Enumeration, Cryptography, 0102 computer and information sciences, Distribution, 01 natural sciences

Přístupová URL adresa: https://hdl.handle.net/10525/3867

Construction and enumeration of Boolean functions with maximum algebraic immunity

Autoři: WenYing Zhang XiangZhong Liu ChuanKun Wu

Zdroj: Science in China Series F: Information Sciences. 52:32-40

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/article/10.1007%2Fs11432-009-0007-y
https://dblp.uni-trier.de/db/journals/chinaf/chinaf52.html#ZhangWL09
http://ir.iscas.ac.cn/handle/311060/7704
https://core.ac.uk/display/143691924
https://rd.springer.com/article/10.1007/s11432-009-0007-y

Stratification and enumeration of Boolean functions by canalizing depth

Autoři: He, Qijun Macauley, Matthew

Témata: Computer Science - Discrete Mathematics, Mathematics - Combinatorics, Physics - Biological Physics, text

URL: http://arxiv.org/abs/1504.07591

Enumeration of Fanout-Free Boolean Functions: Enumeration of fanout-free Boolean functions

Autoři: John P. Hayes

Zdroj: Journal of the ACM. 23:700-709

Témata: Classical propositional logic, Switching theory, application of Boolean algebra, Boolean functions, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jacm/jacm23.html#Hayes76
https://dl.acm.org/doi/10.1145/321978.321988
https://doi.org/10.1145/321978.321988

Interior and exterior functions of positive Boolean functions: Interior and exterior functions of positive Boolean functions.

Autoři: Kazuhisa Makino Hirotaka Ono Toshihide Ibaraki

Zdroj: Discrete Applied Mathematics. 130:417-436

Témata: Artificial intelligence, Exterior function, Analysis of algorithms and problem complexity, Applied Mathematics, Polynomial algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Positive Boolean function, 01 natural sciences, Interior function, Discrete Mathematics and Combinatorics, Boolean functions, Combinatorial enumeration

Popis souboru: application/xml

Exact enumeration of fixed points of AND-OR-NAND-NOR Boolean networks.

Autoři: Aledo, Juan A. Llano, Jose P. Valverde, Jose C.

Zdroj: Chaos, Solitons & Fractals. Jun2025, Vol. 195, pN.PAG-N.PAG. 1p.

Témata: *BOOLEAN networks, *BOOLEAN functions, *SET functions

Attractor detection and enumeration algorithms for Boolean networks

Autoři: 90261859 Mori, Tomoya Akutsu, Tatsuya

Témata: Boolean network, Singleton attractor, Periodic attractor, Computational complexity, SAT, Nested canalyzing function, journal article

URL: http://hdl.handle.net/2433/274538
10.1016/j.csbj.2022.05.027

Priority Arbiter PUF: Analysis.

Autoři: Kansal, Meenakshi Roy, Animesh Roy, Dibyendu a další

Zdroj: Discrete Applied Mathematics. Oct2024, Vol. 356, p71-95. 25p.

Témata: *BOOLEAN functions, *GENERATING functions, *SET functions, *ESTIMATION bias, *PHYSICAL mobility

On the distribution of sensitivities of symmetric Boolean functions

Autoři: Butler, Jon T. Sasao, Tsutomu Nagayama, Shinobu

Témata: Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/2306.14401

Attractor detection and enumeration algorithms for Boolean networks.

Autoři: Akutsu, Tatsuya Mori, Tomoya

Témata: Boolean network, Singleton attractor, Periodic attractor, Computational complexity, SAT, Nested canalyzing function, Journal Article., VoR.

URL: http://hdl.handle.net/2433/274538
https://doi.org/10.1016/j.csbj.2022.05.027
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/274538/1/j.csbj.2022.05.027.pdf
35685366

Minimization of Boolean functions in the class of orthogonal disjunctive normal forms

Autoři: Yu. V. Pottosin

Zdroj: Informatika, Vol 18, Iss 2, Pp 33-47 (2021)

Témata: independent set, boolean function, intersection graph, Electronic computers. Computer science, orthogonal terms, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, short cover problem, disjunctive normal form, dominating set, QA75.5-76.95, 02 engineering and technology

Přístupová URL adresa: https://inf.grid.by/jour/article/download/1131/989
https://doaj.org/article/3a09ceb9f3204a7193792be027f23a2b
https://inf.grid.by/jour/article/view/1131

Compression with wildcards: Abstract simplicial complexes

Autoři: Wild, Marcel

Zdroj: Quaestiones Mathematicae; Vol. 46 No. 6 (2023); 1151–1173

Témata: FOS: Computer and information sciences, Abstract simplicial complex, face-numbers, antitone Boolean function, exclusive sum of products, binary decision diagram, compressed enumeration, wildcards, reliability polynomial, partitionability conjecture, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1812.02570
https://www.ajol.info/index.php/qm/article/view/254699