Search Results - Boolean function complexity~

Level-p-complexity of Boolean functions using thinning, memoization, and polynomials

Authors: Jansson, Julia Jansson, Patrik

Source: Journal of Functional Programming. 33

File Description: electronic

Access URL: https://research.chalmers.se/publication/539327
https://research.chalmers.se/publication/538720
https://research.chalmers.se/publication/540785
https://research.chalmers.se/publication/540785/file/540785_Fulltext.pdf

Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions

Authors: Walter, Matthias

Source: Open Journal of Mathematical Optimization, Vol 5, Iss , Pp 1-12 (2024)

Subject Terms: Pseudo-Boolean optimization, multilinear optimization, Mathematics, QA1-939

File Description: electronic resource

Relation: https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.34/; https://doaj.org/toc/2777-5860

Access URL: https://doaj.org/article/7eeb38dbd35248a1ad654d09d3f09c10

On the relationship between energy complexity and other boolean function measures

Authors: Sun, Xiaoming Sun, Yuan Wu, Kewen et al.

Source: Journal of Combinatorial Optimization. 43(5)

Subject Terms: Applied Mathematics, Pure Mathematics, Mathematical Sciences, Affordable and Clean Energy, Numerical and Computational Mathematics, Computation Theory & Mathematics, Applied mathematics, Pure mathematics

Access URL: https://escholarship.org/uc/item/63k3d6xt

Topological aspects of Boolean functions

Authors: Björner, Anders. Goresky, Mark Macpherson, Robert

Source: Pure and Applied Mathematics Quarterly. 20(3):1029-1063

Subject Terms: Boolean function, circuit complexity, order complex, Betti number, simplicial sheaf

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-349758

Quantum Advantages via Fourier Growth Analysis of Boolean Functions

Authors: Wu, Kewen

Subject Terms: Computer science, Mathematics, Quantum physics, Theoretical mathematics, Boolean function analysis, Communication complexity, Fourier analysis, Quantum-classical separation, Query complexity

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/1bz673g0
https://escholarship.org/content/qt1bz673g0/qt1bz673g0.pdf

On the structure, complexity, and depth of the circuits over the basis {&,˅} realizing step Boolean functions

Authors: S.A. Lozhkin D.S. Kinzhikeyeva

Source: Учёные записки Казанского университета: Серия Физико-математические науки, Vol 162, Iss 3, Pp 335-349 (2020)

Subject Terms: boolean circuits, basis {& ∨}, step boolean functions, complexity and depth minimization, structure of minimal circuits, Mathematics, QA1-939

File Description: electronic resource

Relation: https://kpfu.ru/uz-eng-phm-2020-3-8.html; https://doaj.org/toc/2541-7746; https://doaj.org/toc/2500-2198

Access URL: https://doaj.org/article/94b1dcb9ac67462d908d24bff8e72006

Certificate complexity of elementary symmetric Boolean functions.

Authors: Zhang, Jing Li, Yuan

Source: Theoretical Computer Science. Nov2022, Vol. 938, p16-23. 8p.

Subject Terms: *SYMMETRIC functions, *BOOLEAN functions, *COMPUTER engineering, *INFORMATION technology, *COMPUTER science

A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications

Authors: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave et al.

Contributors: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave et al.

Subject Terms: Boolean function complexity, randomized communication complexity, ddc:004, parity decision trees

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.37

Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms

Authors: A.S. Baliuk

Source: Известия Иркутского государственного университета: Серия "Математика", Vol 30, Iss 1, Pp 125-140 (2019)

Subject Terms: boolean function, lower bound, extension of finite field, mersenne prime, Mathematics, QA1-939

File Description: electronic resource

Relation: http://mathizv.isu.ru/en/article/file?id=1325; https://doaj.org/toc/1997-7670; https://doaj.org/toc/2541-8785

Access URL: https://doaj.org/article/f4fb8f777f5e444fad5db7ae20d1203b

Boolean Function Complexity : Advances and Frontiers

Authors: Stasys Jukna

Resource Type: eBook.

Subjects: Computational complexity, Computer science--Mathematics, Combinatorial analysis

Categories: MATHEMATICS / Applied, COMPUTERS / Computer Science, MATHEMATICS / Discrete Mathematics

Relationships between the number of inputs and other complexity measures of Boolean functions

Authors: Jake Wellens

Source: Discrete Analysis (2022)

Subject Terms: Mathematics, QA1-939

File Description: electronic resource

Relation: https://doaj.org/toc/2397-3129

Access URL: https://doaj.org/article/071d65225d0e4fe291add17d526838b0

Partial Boolean Functions With Exact Quantum Query Complexity One

Authors: Guoliang Xu Daowen Qiu

Source: Entropy, Vol 23, Iss 2, p 189 (2021)

Subject Terms: quantum computation, quantum query complexity, quantum query algorithm, partial Boolean function, Science, Astrophysics, QB460-466, Physics, QC1-999

File Description: electronic resource

Relation: https://www.mdpi.com/1099-4300/23/2/189; https://doaj.org/toc/1099-4300

Access URL: https://doaj.org/article/217318abea61480fbcc10e086136dcd4

The Complexity of the Representation of Multiple-Output Boolean Functions

Authors: S. Vinokurov A. Frantseva

Source: Известия Иркутского государственного университета: Серия "Математика", Vol 16, Iss 1, Pp 30-42 (2016)

Subject Terms: boolean function, Shannon function, complexity, Toffoli gates, reversible circuits, Reed-Muller forms, Mathematics, QA1-939

File Description: electronic resource

Relation: http://isu.ru/journal/downloadArticle?article=_98a8b64bb79447e4b17289cf4fe21200&lang=rus; https://doaj.org/toc/1997-7670; https://doaj.org/toc/2541-8785

Access URL: https://doaj.org/article/0a5a8c6b2c9743928da4e9eef1067d0f

On the complexity of Boolean functions computed by lazy oracles: On the complexity of Boolean functions computed by lazy oracles.

Authors: Paul E. Dunne G.F. Nwana Paul H. Leng

Source: IEEE Transactions on Computers. 44:495-502

Subject Terms: demand-driven simulation, Boolean function complexity, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, circuit simulation, 0202 electrical engineering, electronic engineering, information engineering, symmetric Boolean functions, lazy evaluation, 02 engineering and technology, Simulation

File Description: application/xml

Access URL: https://zbmath.org/1964058
https://doi.org/10.1109/12.376165
https://ieeexplore.ieee.org/document/376165/
http://ieeexplore.ieee.org/document/376165/
https://dblp.uni-trier.de/db/journals/tc/tc44.html#DunneLN95

On the Relationship Between Energy Complexity and Other Boolean Function Measures

Authors: Sun, Xiaoming Sun, Yuan Wu, Kewen et al.

Subject Terms: Energy complexity, Decision tree, Boolean function, Circuit complexity, Artificial Intelligence & Image Processing

Access URL: https://escholarship.org/uc/item/65k182vj

On the Probabilistic Degree of an $n$-variate Boolean Function

Authors: Srinivasan, Srikanth Venkitesh, S. Srikanth Srinivasan and S. Venkitesh et al.

Contributors: Srinivasan, Srikanth Venkitesh, S. Srikanth Srinivasan and S. Venkitesh et al.

Source: Srinivasan, S & Venkitesh, S 2021, On the probabilistic degree of an n-variate boolean function. in M Wootters & L Sanita (eds), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021., 42, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 207, 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021, Virtual, Seattle, United States, 16/08/2021. https://doi.org/10.4230/LIPIcs-APPROX/RANDOM.2021.42

Subject Terms: Probabilistic degree, FOS: Computer and information sciences, 4. Education, Probabilistic polynomial, Truly n-variate, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, probabilistic degree, Computer Science - Computational Complexity, Boolean function, truly n-variate, probabilistic polynomial, ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2107.03171
https://arxiv.org/pdf/2107.03171
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.42
https://drops.dagstuhl.de/opus/volltexte/2021/14735/
https://drops.dagstuhl.de/opus/volltexte/2021/14735/pdf/LIPIcs-APPROX42.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2107.html#abs-2107-03171
https://arxiv.org/abs/2107.03171
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.42

Harmonic analysis and Boolean function complexity

Authors: BERNASCONI, ANNA

Source: Calcolo. 35:149-186

Subject Terms: Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type, Analysis of algorithms and problem complexity, Fourier transform, 0211 other engineering and technologies, Numerical methods for trigonometric approximation and interpolation, 0102 computer and information sciences, 02 engineering and technology, Boolean functions, 01 natural sciences, Boolean circuit complexity

File Description: application/xml

Access URL: https://zbmath.org/1234310
https://doi.org/10.1007/s100920050014
https://link.springer.com/article/10.1007/s100920050014
https://core.ac.uk/display/54877073
https://hdl.handle.net/11568/49129

Composition Limits and Separating Examples for Some Boolean Function Complexity Measures

Authors: GILMER, J SAKS, M SRINIVASAN, S

Source: 2013 IEEE Conference on Computational Complexity. :185-196

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Prams, 0102 computer and information sciences, Computational Complexity (cs.CC), 0101 mathematics, 16. Peace & justice, 01 natural sciences

Access URL: http://arxiv.org/pdf/1306.0630
http://arxiv.org/abs/1306.0630
https://link.springer.com/article/10.1007/s00493-014-3189-x
http://ui.adsabs.harvard.edu/abs/2013arXiv1306.0630G/abstract
https://www.computer.org/csdl/proceedings-article/ccc/2013/4997a185/12OmNwtn3z4
https://dblp.uni-trier.de/db/journals/corr/corr1306.html#GilmerSS13
https://arxiv.org/abs/1306.0630
http://ieeexplore.ieee.org/document/6597761/
https://rd.springer.com/article/10.1007/s00493-014-3189-x
https://dl.acm.org/doi/10.1007/s00493-014-3189-x
https://dblp.uni-trier.de/db/journals/combinatorica/combinatorica36.html#GilmerSS16

Approximate Degree Composition for Recursive Functions

Authors: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat et al.

Contributors: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat et al.

Source: Chakraborty, S, Kayal, C, Mittal, R, Paraashar, M & Saurabh, N 2024, ' Approximate Degree Composition for Recursive Functions ', Leibniz International Proceedings in Informatics, LIPIcs, vol. 317 . https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.71

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Composition theorem, Approximate degree, Boolean function, ddc:004, Computational Complexity (cs.CC)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2407.08385
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.71
https://curis.ku.dk/ws/files/413643584/LIPIcs.APPROX_RANDOM.2024.71.pdf

Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling

Authors: Ajmal Beg Azam Beg P. W. Chandana Prasad

Source: Expert Systems with Applications. 34:2436-2443

Subject Terms: T Technology (General), 0202 electrical engineering, electronic engineering, information engineering, QA75.5-76.95 Electronic computers. Computer science, 02 engineering and technology

File Description: text

Access URL: http://core.ac.uk/display/18231681
https://dblp.uni-trier.de/db/journals/eswa/eswa34.html#BegPB08
https://www.sciencedirect.com/science/article/pii/S0957417407001364
http://www.sciencedirect.com/science/article/pii/S0957417407001364