Search Results - monotone boolean function complexity*

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

Authors: Alice Raffaele Romeo Rizzi

Source: Discrete Applied Mathematics. 361:347-369

Subject Terms: Dualization, Monotone Boolean function, Full cover, Clutter and blocker, Hypergraph transversal, Quasi-polynomial time

File Description: application/pdf

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

Authors: Couceiro, Miguel Mercuriali, Pierre Péchoux, Romain et al.

Contributors: Couceiro, Miguel Mercuriali, Pierre Péchoux, Romain et al.

Subject Terms: [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], Principes généraux des mathématiques, Efficient representation, Normal form, Boolean function, Lattice polynomial, Complexity

File Description: application/pdf

Access URL: https://inria.hal.science/hal-01905491v1

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

Authors: Omri Weinstein Dana Ron Alex Samorodnitsky et al.

Source: ACM Transactions on Computation Theory. 4:1-12

Subject Terms: 0102 computer and information sciences, 01 natural sciences

Access URL: https://dspace.mit.edu/bitstream/1721.1/73917/1/Rubinfeld_Approximating%20the%20influence.pdf
https://dspace.mit.edu/openaccess-disseminate/1721.1/73917
https://dspace.mit.edu/handle/1721.1/73917
https://dl.acm.org/doi/abs/10.1145/2382559.2382562
https://link.springer.com/content/pdf/10.1007%2F978-3-642-22935-0_56.pdf
https://link.springer.com/chapter/10.1007%2F978-3-642-22935-0_56
https://dblp.uni-trier.de/db/journals/toct/toct4.html#RonRSSW12

Study on Using Reinforcement Learning for the Monotone Boolean Reconstruction.

Authors: Sahakyan, Hasmik Katona, Gyula Aslanyan, Levon

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

Subject Terms: Reinforcement learning, Boolean functions, Shadowing theorem (Mathematics), Problem solving, Algorithms

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

Authors: Vetle I. Torvik Evangelos Triantaphyllou

Source: INFORMS Journal on Computing. 14:144-174

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arrowsmith.psych.uic.edu/arrowsmith_uic/tutorial/torvik_joc_2002.pdf
https://core.ac.uk/display/24703818
https://pubsonline.informs.org/doi/abs/10.1287/ijoc.14.2.144.117
http://bit.csc.lsu.edu/trianta/Journal_PAPERS1/INFORMS2002PaperonMonotoneBooleanFunctionsByTRIANTA1.pdf
https://ideas.repec.org/a/inm/orijoc/v14y2002i2p144-174.html
https://doi.org/10.1287/ijoc.14.2.144.117
https://dblp.uni-trier.de/db/journals/informs/informs14.html#TorvikT02

Rivest–Vuillemin conjecture is true for monotone boolean functions with twelve variables: Rivest-Vuillemin conjecture is true for monotone Boolean functions with twelve variables

Authors: Xiaohua Jia Sui-Xiang Gao xiao-Dong Hun et al.

Source: Discrete Mathematics. 253:19-34

Subject Terms: Monotone Boolean function, Boolean function, Decision tree, Elusive, Complexity classes (hierarchies, relations among complexity classes, etc.), Discrete Mathematics and Combinatorics, Combinatorics in computer science, 0102 computer and information sciences, Boolean functions, 0101 mathematics, 01 natural sciences, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science

File Description: application/xml

Access URL: https://zbmath.org/1792439
https://doi.org/10.1016/s0012-365x(01)00446-0
https://conservancy.umn.edu/handle/11299/215438
https://scholars.cityu.edu.hk/en/publications/rivestvuillemin-conjecture-is-true-for-monotone-boolean-functions-with-twelve-variables(cbb8bdc9-24b9-48b8-87fc-2be6e13b5858).html
https://conservancy.umn.edu/bitstream/11299/215438/1/00-051.pdf
https://dblp.uni-trier.de/db/journals/dm/dm253.html#GaoDHJ02
https://www.sciencedirect.com/science/article/abs/pii/S0012365X01004460
https://www.sciencedirect.com/science/article/pii/S0012365X01004460

The complexity of monotone boolean functions: The complexity of monotone Boolean functions

Authors: Nicholas Pippenger

Source: Mathematical Systems Theory. 11:289-316

Subject Terms: Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/mst/mst11.html#Pippenger78
https://link.springer.com/article/10.1007%2FBF01768483
https://scholarship.claremont.edu/hmc_fac_pub/604/

Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity

Authors: Ron, Dana Rubinfeld, Ronitt Safra, Muli et al.

Contributors: Ron, Dana Rubinfeld, Ronitt Safra, Muli et al.

Source: Lecture Notes in Computer Science ISBN: 9783642229343
arXiv

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: https://dspace.mit.edu/bitstream/1721.1/73917/1/Rubinfeld_Approximating%20the%20influence.pdf
http://arxiv.org/abs/1101.5345
http://hdl.handle.net/1721.1/73917
https://orcid.org/0000-0002-4353-7639

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

Authors: Ron, Dana Rubinfeld, Ronitt Safra, Muli et al.

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, text

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

Almost all monotone Boolean functions are polynomially learnable using membership queries

Authors: Aleksey D. Korshunov Jaakko Astola Ilya Shmulevich

Source: Information Processing Letters. 79:211-213

Subject Terms: Computational complexity, Membership query, Monotone Boolean function, 0211 other engineering and technologies, Computational learning theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Learning, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1767381
https://doi.org/10.1016/s0020-0190(00)00225-8
https://www.sciencedirect.com/science/article/pii/S0020019000002258
http://www.sciencedirect.com/science/article/pii/S0020019000002258
https://dblp.uni-trier.de/db/journals/ipl/ipl79.html#ShmulevichKA01
https://doi.org/10.1016/S0020-0190(00)00225-8

Approximating the noise sensitivity of a monotone Boolean function

Authors: Rubinfeld, Ronitt Vasilyan, Arsen Ronitt Rubinfeld and Arsen Vasilyan et al.

Contributors: Rubinfeld, Ronitt Vasilyan, Arsen Ronitt Rubinfeld and Arsen Vasilyan et al.

Subject Terms: FOS: Computer and information sciences, influence, noise sensitivity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Monotone Boolean functions, 0102 computer and information sciences, ddc:004, 0101 mathematics, 01 natural sciences

File Description: application/pdf; application/octet-stream

Access URL: http://arxiv.org/abs/1904.06745
https://paperity.org/p/204242365/approximating-the-noise-sensitivity-of-a-monotone-boolean-function
http://drops.dagstuhl.de/opus/volltexte/2019/11267/pdf/LIPIcs-APPROX-RANDOM-2019-52.pdf
https://drops.dagstuhl.de/opus/volltexte/2019/11267/pdf/LIPIcs-APPROX-RANDOM-2019-52.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-06745
https://dspace.mit.edu/handle/1721.1/127450
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.52

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

Authors: Couceiro, M. Mercuriali, Pierre Péchoux, Romain et al.

Subject Terms: 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

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

Any Monotone Function Is Realized by Interlocked Polygons

Authors: Demaine, Erik D. Demaine, Martin L. Uehara, Ryuhei et al.

Contributors: Demaine, Erik D. Demaine, Martin L. Uehara, Ryuhei et al.

Source: Algorithms, Vol 5, Iss 1, Pp 148-157 (2012)
Algorithms; Volume 5; Issue 1; Pages: 148-157
MDPI

Subject Terms: computational complexity, Industrial engineering. Management engineering, Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, monotone boolean function, interlocked polygons, sliding block puzzle, QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, T55.4-60.8, 01 natural sciences

File Description: application/pdf

Access URL: http://www.mdpi.com/1999-4893/5/1/148/pdf
https://doaj.org/article/35ab6a88aeb0459a89c91ad658a3167a
http://hdl.handle.net/1721.1/86068
https://orcid.org/0000-0003-3803-5703

Replaceability and computational equivalence for monotone boolean functions

Authors: Meurig Beynon

Source: Acta Informatica. 22:433-449

Subject Terms: 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

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/acta/acta22.html#Beynon85
https://link.springer.com/article/10.1007%2FBF00288777

Lower bounds for the monotone complexity of some Boolean functions

Authors: Razborov, A. A.

Subject Terms: Classical propositional logic, constructive sequences, monotone Boolean function, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, monotone complexity

File Description: application/xml

Access URL: https://zbmath.org/4008289

Reductions for monotone Boolean circuits

Authors: Hiroki Morizumi Kazuo Iwama Jun Tarui

Source: Theoretical Computer Science. 408:208-212

Subject Terms: 0301 basic medicine, Majority function, Merging function, 03 medical and health sciences, Negation-limited circuit, 0102 computer and information sciences, Monotone circuit, Circuit complexity, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Access URL: https://link.springer.com/chapter/10.1007/11821069_47
https://dblp.uni-trier.de/db/journals/tcs/tcs408.html#IwamaMT08
https://www.sciencedirect.com/science/article/pii/S030439750800563X
https://core.ac.uk/display/82336117
https://link.springer.com/content/pdf/10.1007%2F11821069_47.pdf
https://rd.springer.com/chapter/10.1007/11821069_47

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

Authors: Ron, Dana Rubinfeld, Ronitt Safra, Muli et al.

Contributors: Ron, Dana Rubinfeld, Ronitt Safra, Muli et al.

Source: arXiv

File Description: 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.

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

On the planar monotone computation of boolean functions: On the planar monotone computation of Boolean functions

Authors: Meuring Beynon John Buckle

Source: Theoretical Computer Science. 53:267-279

Subject Terms: 0209 industrial biotechnology, Analysis of algorithms and problem complexity, 02 engineering and technology, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc, prime implicants, clauses, Theoretical Computer Science, monotone Boolean function, Switching theory, application of Boolean algebra, Boolean functions, planar monotone computable, 0101 mathematics, planar monotone circuit, Computer Science(all)

File Description: application/xml

Access URL: https://zbmath.org/4039805
https://doi.org/10.1016/0304-3975(87)90068-5
https://core.ac.uk/display/82557758
https://dblp.uni-trier.de/db/journals/tcs/tcs53.html#BeynonB87
https://www.sciencedirect.com/science/article/pii/0304397587900685

Notes on Boolean read-k and multilinear circuits

Authors: Stasys Jukna

Source: Discrete Applied Mathematics. 360:307-327

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 68Q17, 94C11, Computational Complexity (cs.CC), 01 natural sciences

Access URL: http://arxiv.org/abs/2207.08701

On the Fourier spectrum of monotone functions

Authors: Nader H. Bshouty Christino Tamon

Source: Journal of the ACM. 43:747-770

Subject Terms: Fourier transform, monotone Boolean, Complexity classes (hierarchies, relations among complexity classes, etc.), approximation, learning algorithms

File Description: application/xml

Access URL: https://prism.ucalgary.ca/bitstream/1880/45749/2/1995-554-6.pdf
https://zbmath.org/1106120
https://doi.org/10.1145/234533.234564
https://prism.ucalgary.ca/bitstream/1880/45749/2/1995-554-6.pdf
http://portal.acm.org/citation.cfm?doid=225058.225125
https://dl.acm.org/doi/10.1145/225058.225125
https://prism.ucalgary.ca/handle/1880/45749
https://dl.acm.org/doi/10.1145/234533.234564
https://dblp.uni-trier.de/db/journals/jacm/jacm43.html#BshoutyT96
http://core.ac.uk/display/21257904