Výsledky vyhledávání - enumeration of Boolean functions

On the enumeration of some inequivalent monotone Boolean functions

Autoři: Freixas Bosch, Josep Universitat Politècnica de Catalunya. Departament de Matemàtiques

Přispěvatelé: Freixas Bosch, Josep Universitat Politècnica de Catalunya. Departament de Matemàtiques

Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Témata: Classificació AMS::91 Game theory, economics, social and behavioral sciences::91B Mathematical economics, recurrence relations, Classificació AMS::65 Numerical analysis::65Q05 Difference and functional equations, recurrence relations, social and behavioral sciences::91B Mathematical economics, 0211 other engineering and technologies, Enumeration of Boolean functions, Enumeration of tripartite and quadripartite simple games, Simple games, 02 engineering and technology, Inequivalent monotone Boolean functions, Dedekind numbers, Algebra, Boolean, social and behavioral sciences::91A Game theory, 0502 economics and business, series, Jocs, Teoria de, Game theory, Classificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory, Teoria de, 05 social sciences, Classificació AMS::91 Game theory, Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs, economics, Jocs, Classificació AMS::65 Numerical analysis::65Q05 Difference and functional equations, Classificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science, Algebra, Classificació AMS::40 Sequences, summability::40B05 Multiple sequences and series, Boolean, Àlgebra booleana, Classificació AMS::40 Sequences, series, summability::40B05 Multiple sequences and series

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/2117/382121
https://doi.org/10.1080/02331934.2022.2154126

On the enumeration of Boolean functions with distinguished variables

Autoři: Freixas Bosch, Josep Universitat Politècnica de Catalunya. Departament de Matemàtiques Universitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs

Přispěvatelé: Freixas Bosch, Josep Universitat Politècnica de Catalunya. Departament de Matemàtiques Universitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs

Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Témata: Classificació AMS::91 Game theory, economics, social and behavioral sciences::91B Mathematical economics, social and behavioral sciences::91B Mathematical economics, 0211 other engineering and technologies, Classificació AMS::94 Information And Communication, Enumeration of Boolean functions, Simple games, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Classificació AMS::90 Operations research, mathematical programming::90B Operations research and management science, Algebra, Boolean, social and behavioral sciences::91A Game theory, 90 Operations research, mathematical programming::90B Operations research and management science [Classificació AMS], Classificació AMS::06 Order, ordered algebraic structures::06E Boolean algebras (Boolean rings), 91 Game theory, economics, social and behavioral sciences::91B Mathematical economics [Classificació AMS], Boolean functions, Jocs, Teoria de, Matemàtiques i estadística::Investigació operativa::Teoria de jocs [Àrees temàtiques de la UPC], Game theory, Classificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory, Dedekind's problem, 2-Monotonic Boolean functions, Classificació AMS::90 Operations research, Teoria de, Circuits::94C Circuits, Classificació AMS::06 Order, lattices, ordered algebraic structures::06E Boolean algebras (Boolean rings), Classificació AMS::91 Game theory, Classificació AMS::94 Information And Communication, Circuits::94C Circuits, networks, Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs, economics, 91 Game theory, economics, social and behavioral sciences::91A Game theory [Classificació AMS], Jocs, 06 Order, lattices, ordered algebraic structures::06E Boolean algebras (Boolean rings) [Classificació AMS], 94 Information And Communication, Circuits::94C Circuits, networks [Classificació AMS], Complete games, Algebra, mathematical programming::90B Operations research and management science, lattices, networks, Boolean, Àlgebra booleana

Popis souboru: application/pdf

Přístupová URL adresa: https://upcommons.upc.edu/bitstream/2117/341224/1/SOCO-D-20-01233-final-version.pdf
https://hdl.handle.net/2117/341224
https://doi.org/10.1007/s00500-020-05422-5

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

On the enumeration of some inequivalent monotone Boolean functions

Autoři: Universitat Politècnica de Catalunya. Departament de Matemàtiques Freixas Bosch, Josep

Témata: Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs, Game theory, Algebra, Boolean, Dedekind numbers, Inequivalent monotone Boolean functions, Simple games, Enumeration of tripartite and quadripartite simple games, Enumeration of Boolean functions, Jocs, Teoria de, Àlgebra booleana, Classificació AMS::40 Sequences, series, summability::40B05 Multiple sequences and series, Classificació AMS::65 Numerical analysis::65Q05 Difference and functional equations, recurrence relations, Classificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science, Classificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory, Classificació AMS::91 Game theory, economics, social and behavioral sciences::91B Mathematical economics, Article

URL: http://hdl.handle.net/2117/382121
https://www.tandfonline.com/doi/abs/10.1080/02331934.2022.2154126
https://www.tandfonline.com/doi/abs/10.1080/02331934.2022.2154126
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104987GB-I00/ES/JUEGOS DE VOTACION Y COOPERACION CON APLICACIONES A LAS REDES SOCIALES Y A LAS CIENCIAS POLITICAS

On the enumeration of Boolean functions with distinguished variables

Autoři: Universitat Politècnica de Catalunya. Departament de Matemàtiques Universitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs Freixas Bosch, Josep

Témata: Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs, Game theory, Algebra, Boolean, Boolean functions, 2-Monotonic Boolean functions, Simple games, Complete games, Enumeration of Boolean functions, Dedekind’s problem, Jocs, Teoria de, Àlgebra booleana, Classificació AMS::06 Order, lattices, ordered algebraic structures::06E Boolean algebras (Boolean rings), Classificació AMS::90 Operations research, mathematical programming::90B Operations research and management science, Classificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory, Classificació AMS::91 Game theory, economics, social and behavioral sciences::91B Mathematical economics, Classificació AMS::94 Information And Communication, Circuits::94C Circuits, networks, Article

URL: http://hdl.handle.net/2117/341224
https://link.springer.com/article/10.1007/s00500-020-05422-5
https://link.springer.com/article/10.1007/s00500-020-05422-5
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104987GB-I00/ES/JUEGOS DE VOTACION Y COOPERACION CON APLICACIONES A LAS REDES SOCIALES Y A LAS CIENCIAS POLITICAS

Entropy and enumeration of Boolean functions

Autoři: H. Pippenger

Zdroj: IEEE Transactions on Information Theory. 45:2096-2100

Témata: combinatorial enumeration, Measures of information, entropy, monotone Boolean functions, Shannon entropy, Horn functions, 0102 computer and information sciences, Boolean functions, 0101 mathematics, Asymptotic enumeration, asymptotic formulas, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1503183
https://doi.org/10.1109/18.782146

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

Enumeration of boolean functions with a fixed number of affine products

Autoři: A. V. Cheremushkin

Zdroj: Prikladnaya diskretnaya matematika. Prilozhenie. :43-47

Přístupová URL adresa: http://journals.tsu.ru/uploads/import/1294/files/8_043.pdf

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

On the enumeration of Boolean functions with distinguished variables.

Autoři: Freixas, Josep

Zdroj: Soft Computing - A Fusion of Foundations, Methodologies & Applications; Oct2021, Vol. 25 Issue 19, p12627-12640, 14p

Témata: BOOLEAN functions, LOGIC circuits, MACHINE learning, GAME theory, CRYPTOGRAPHY, HYPERGRAPHS

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 Even-Variable Boolean Functions with Maximum Algebraic Immunity

Autoři: Xin Hai Yanfeng Wang Chao Li a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642354151

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2F978-3-642-35416-8_4.pdf
https://link.springer.com/chapter/10.1007/978-3-642-35416-8_4
https://rd.springer.com/chapter/10.1007/978-3-642-35416-8_4

On the number of Boolean functions in the Post classes F μ 8: On the number of Boolean functions in the Post classes \(F_8^\mu\)

Autoři: V. Jovović G. Kilibarda

Zdroj: Discrete Mathematics and Applications. 9

Témata: enumeration of Boolean functions, hypergraph, Post classes, Boolean functions, Enumeration in graph theory, Hypergraphs

Popis souboru: application/xml

Přístupová URL adresa: https://www.degruyter.com/document/doi/10.1515/dma.1999.9.6.593/html

Estimating the Number of Local Optima in Multimodal Pseudo-Boolean Functions: Validation via Landscapes of Triangles

Autoři: Sánchez-Díaz, Xavier F. C. Mengshoel, Ole Jakob

Dostupnost: https://hdl.handle.net/11250/3151145

Enumeration of Balanced Rotation-Symmetric Boolean Functions.

Autoři: Zhang Peng Fu Shao-jing Qu Long-jiang a další

Zdroj: Journal of Applied Sciences - Electronics & Information Engineering. 2012, Vol. 30 Issue 1, p45-51. 7p.

On the criteria and enumeration of Boolean functions used in stream ciphers.

Autoři: Wang, Jianyu

Témata: Shift register sequences and sequences over finite alphabets in information and communication theory, Cryptography, linear structure functions, balance, Boolean functions, Stream ciphers

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1208854

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: boolean function, disjunctive normal form, orthogonal terms, short cover problem, intersection graph, dominating set, independent set, Electronic computers. Computer science, QA75.5-76.95

Popis souboru: electronic resource

Relation: https://inf.grid.by/jour/article/view/1131; https://doaj.org/toc/1816-0301

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

And/or tree probabilities of Boolean functions

Autoři: Danièle Gardy Alan Woods

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)

Témata: boolean formula, and/or tree, tree enumeration, tautology, [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds], [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [math.math-co] mathematics [math]/combinatorics [math.co], [info.info-cg] computer science [cs]/computational geometry [cs.cg], [info.info-hc] computer science [cs]/human-computer interaction [cs.hc], Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://dmtcs.episciences.org/3355/pdf; https://doaj.org/toc/1365-8050

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

Method of restoring multivariable Boolean function from its derivative

Autoři: Alexander V. Mazurenko Nadezhda S. Mogilevskaya

Zdroj: Advanced Engineering Research, Vol 17, Iss 1, Pp 122-131 (2017)

Témata: булева функция, производная булевой функции по направлению, алгоритм проверки возможности восстановления булевой функции, оценка сложности, пространство булевых функций, кольцо многочленов, конечные поля, кольцевой изоморфизм, теория кодирования, поиск прообраза, boolean function, directional derivative of boolean function, algorithm of checking recoverability of boolean function, complexity estimation, space of boolean functions, polynomial ring, finite fields, ring isomorphism, coding theory, preimage searching, Materials of engineering and construction. Mechanics of materials, TA401-492

Popis souboru: electronic resource

Relation: https://www.vestnik-donstu.ru/jour/article/view/254; https://doaj.org/toc/2687-1653

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