Výsledky vyhledávání - monotone boolean function complexity

New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems.

Autoři: Raffaele, Alice Rizzi, Romeo

Zdroj: Discrete Applied Mathematics. Jan2025, Vol. 361, p347-369. 23p.

Témata: *TIME complexity, *MATROIDS, *BOOLEAN functions, *DATA mining, *ARTIFICIAL intelligence

Study on Using Reinforcement Learning for the Monotone Boolean Reconstruction.

Autoři: Sahakyan, Hasmik Katona, Gyula Aslanyan, Levon

Zdroj: Informatica (03505596). Dec2024, Vol. 48 Issue 4, p521-532. 12p.

Témata: Reinforcement learning, Boolean functions, Shadowing theorem (Mathematics), Problem solving, Algorithms

On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials

Autoři: Couceiro, Miguel Mercuriali, Pierre Péchoux, Romain a další

Přispěvatelé: Couceiro, Miguel Mercuriali, Pierre Péchoux, Romain a další

Zdroj: ISSN: 1542-3980.

Témata: Complexity, Normal form, Efficient representation, Lattice polynomial, Boolean function, [MATH.MATH-AC]Mathematics [math]/Commutative Algebra [math.AC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Dostupnost: https://inria.hal.science/hal-01905491
https://inria.hal.science/hal-01905491v1/document
https://inria.hal.science/hal-01905491v1/file/median_computations_MVLSC-CMPS.pdf

Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity

Autoři: Ron, Dana Rubinfeld, Ronitt Safra, Muli a další

Témata: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, text

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

On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials

Autoři: Couceiro, M. Mercuriali, Pierre Péchoux, Romain a další

Témata: Efficient representation, Complexity, Normal form, Boolean function, Lattice polynomial, Principes généraux des mathématiques

Time: 511

Relation: Journal of Multiple-Valued Logic and Soft Computing; 33; 2019; 197-218; OCP Science; oui; non; https://basepub.dauphine.fr/handle/123456789/21005

Dostupnost: https://basepub.dauphine.fr/handle/123456789/21005
https://hal.inria.fr/hal-01905491

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions.

Autoři: Torvik, Vetle I. Triantaphyllou, Evangelos

Zdroj: INFORMS Journal on Computing. Spring2002, Vol. 14 Issue 2, p144. 31p.

Témata: *BOOLEAN algebra, *RECURSIVE functions, *PARTIALLY ordered sets, *STATISTICAL sampling

Replaceability and computational equivalence for monotone boolean functions

Autoři: Meurig Beynon

Zdroj: Acta Informatica. 22:433-449

Témata: replaceability, abstract simplicial complex, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, Structure and representation theory of distributive lattices, 0202 electrical engineering, electronic engineering, information engineering, monotone boolean networks, 0102 computer and information sciences, 02 engineering and technology, monotone boolean function complexity, computational equivalence, 01 natural sciences, finite distributive lattices

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/acta/acta22.html#Beynon85
https://link.springer.com/article/10.1007%2FBF00288777

Approximating the noise sensitivity of a monotone Boolean function

Autoři: Rubinfeld, Ronitt Vasilyan, Arsen

Témata: Computer Science - Data Structures and Algorithms, text

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

Approximating the influence of monotone boolean functions in O(√n) query complexity

Autoři: Ron, Dana Rubinfeld, Ronitt Safra, Muli a další

Přispěvatelé: Ron, Dana Rubinfeld, Ronitt Safra, Muli a další

Zdroj: arXiv

Popis souboru: application/pdf

Relation: http://dx.doi.org/10.1007/978-3-642-22935-0_56; Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; http://hdl.handle.net/1721.1/73917; Ron, Dana et al. “Approximating the influence of monotone boolean functions in O(√n) query complexity.” Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Ed. Leslie Ann Goldberg et al. LNCS Vol. 6845. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 664–675.

Dostupnost: http://hdl.handle.net/1721.1/73917

Any Monotone Function Is Realized by Interlocked Polygons

Autoři: Erik D. Demaine Martin L. Demaine Ryuhei Uehara

Zdroj: Algorithms, Vol 5, Iss 1, Pp 148-157 (2012)

Témata: computational complexity, interlocked polygons, monotone boolean function, sliding block puzzle, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Popis souboru: electronic resource

Relation: http://www.mdpi.com/1999-4893/5/1/148/; https://doaj.org/toc/1999-4893

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

Guided inference of nested monotone Boolean functions

Autoři: Vetle I. Torvik A Evangelos Triantaphyllou B The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Vetle I. Torvik A Evangelos Triantaphyllou B The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.csc.lsu.edu/trianta/Journal_PAPERS1/LearningMonotnBooleanFunctionsByTrianta1.pdf.

Témata: Nested monotone Boolean functions, Membership queries, Guided infer- ence, Partially ordered sets (posets, Query selection criteria, Average query complexity

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.515.8397; http://www.csc.lsu.edu/trianta/Journal_PAPERS1/LearningMonotnBooleanFunctionsByTrianta1.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.515.8397
http://www.csc.lsu.edu/trianta/Journal_PAPERS1/LearningMonotnBooleanFunctionsByTrianta1.pdf

Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits

Autoři: Lingas, Andrzej Persson, Mia

Témata: Computer Science - Computational Complexity, 68Q06, 94C11, F.2.2, text

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

Shadow Minimization Boolean Function Reconstruction.

Autoři: Aslanyan, Levon Katona, Gyula Sahakyan, Hasmik

Zdroj: Informatica. 2024, Vol. 35 Issue 1, p1-20. 20p.

Témata: *BOOLEAN functions, *ALGORITHMS

Lower bounds for Boolean circuits of bounded negation width.

Autoři: Jukna, Stasys Lingas, Andrzej

Zdroj: Journal of Computer & System Sciences. Nov2022, Vol. 129, p90-105. 16p.

Témata: *CIRCUIT complexity, *PRIME numbers, *BOOLEAN functions, *LOGIC circuits

Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity

Autoři: Ron, Dana Rubinfeld, Ronitt Safra, Muli a další

Přispěvatelé: Ron, Dana Rubinfeld, Ronitt Safra, Muli a další

Zdroj: ACM Transactions on Computation Theory ; volume 4, issue 4, page 1-12 ; ISSN 1942-3454 1942-3462

Dostupnost: https://doi.org/10.1145/2382559.2382562
https://dl.acm.org/doi/10.1145/2382559.2382562
https://dl.acm.org/doi/pdf/10.1145/2382559.2382562

Almost all monotone Boolean functions are polynomially learnable using membership queries

Autoři: Ilya Shmulevich Aleksey D. Korshunov Jaakko Astola a další

Přispěvatelé: Ilya Shmulevich Aleksey D. Korshunov Jaakko Astola a další

Zdroj: http://www2.mdanderson.org/app/ilya/Publications/IPLalmostall.pdf.

Témata: Monotone Boolean function, Learning, Membership query, Computational complexity

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7125; http://www2.mdanderson.org/app/ilya/Publications/IPLalmostall.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7125
http://www2.mdanderson.org/app/ilya/Publications/IPLalmostall.pdf

COMPLEXITY INVESTIGATION OF THE PROBLEM OF PARTIAL MONOTONE BOOLEAN FUNCTION OPTIMAL EXTENSION.

Autoři: Sapozhenko, O. A. Makhina, G. A.

Zdroj: Naukovi visti NTUU - KPI. 2008, Vol. 2008 Issue 4, p90-93. 4p.

Témata: Investigations, Monotone operators, NP-complete problems, Set theory, Extensions

Ceilings of Monotone Boolean Functions

Autoři: Dunne, Paul

Témata: Complexity measures, combinational networks, monotone Boolean functions

Relation: https://zenodo.org/records/6995262; oai:zenodo.org:6995262

Dostupnost: https://doi.org/10.3217/jucs-002-07-0533
https://zenodo.org/records/6995262

NOTES ON HAZARD-FREE CIRCUITS.

Autoři: JUKNA, STASYS¹ stjukna@gmail.com

Zdroj: SIAM Journal on Discrete Mathematics. 2021, Vol. 35 Issue 2, p770-787. 18p.

Témata: *BOOLEAN functions, *CIRCUIT complexity, *BOOLEAN matrices

Approximating the noise sensitivity of a monotone Boolean function

Autoři: Rubinfeld, Ronitt Vasilyan, Arsen Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory a další

Přispěvatelé: Rubinfeld, Ronitt Vasilyan, Arsen Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory a další

Zdroj: DROPS

Popis souboru: application/octet-stream

Relation: Leibniz International Proceedings in Informatics, LIPIcs; https://hdl.handle.net/1721.1/137665.2; 2019. "Approximating the noise sensitivity of a monotone Boolean function." Leibniz International Proceedings in Informatics, LIPIcs, 145.

Dostupnost: https://hdl.handle.net/1721.1/137665.2