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

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

Autoři: Jansson, Julia Jansson, Patrik

Zdroj: Journal of Functional Programming. 33

Popis souboru: electronic

Přístupová URL adresa: 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

Autoři: Walter, Matthias

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

Témata: Pseudo-Boolean optimization, multilinear optimization, Mathematics, QA1-939

Popis souboru: electronic resource

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

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

On the relationship between energy complexity and other boolean function measures

Autoři: Sun, Xiaoming Sun, Yuan Wu, Kewen a další

Zdroj: Journal of Combinatorial Optimization. 43(5)

Témata: Applied Mathematics, Pure Mathematics, Mathematical Sciences, Affordable and Clean Energy, Numerical and Computational Mathematics, Computation Theory & Mathematics, Applied mathematics, Pure mathematics

Přístupová URL adresa: https://escholarship.org/uc/item/63k3d6xt

Topological aspects of Boolean functions

Autoři: Björner, Anders. Goresky, Mark Macpherson, Robert

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

Témata: Boolean function, circuit complexity, order complex, Betti number, simplicial sheaf

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-349758

Quantum Advantages via Fourier Growth Analysis of Boolean Functions

Autoři: Wu, Kewen

Témata: Computer science, Mathematics, Quantum physics, Theoretical mathematics, Boolean function analysis, Communication complexity, Fourier analysis, Quantum-classical separation, Query complexity

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: S.A. Lozhkin D.S. Kinzhikeyeva

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

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

Popis souboru: 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

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

Certificate complexity of elementary symmetric Boolean functions.

Autoři: Zhang, Jing Li, Yuan

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

Témata: *SYMMETRIC functions, *BOOLEAN functions, *COMPUTER engineering, *INFORMATION technology, *COMPUTER science

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

Autoři: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave a další

Přispěvatelé: Cheung, Tsun-Ming Hatami, Hamed Hosseini, Kaave a další

Témata: Boolean function complexity, randomized communication complexity, ddc:004, parity decision trees

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: A.S. Baliuk

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

Témata: boolean function, lower bound, extension of finite field, mersenne prime, Mathematics, QA1-939

Popis souboru: electronic resource

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

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

Boolean Function Complexity : Advances and Frontiers

Autoři: Stasys Jukna

Resource Type: eBook.

Témata: 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

Autoři: Jake Wellens

Zdroj: Discrete Analysis (2022)

Témata: Mathematics, QA1-939

Popis souboru: electronic resource

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

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

Partial Boolean Functions With Exact Quantum Query Complexity One

Autoři: Guoliang Xu Daowen Qiu

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

Témata: quantum computation, quantum query complexity, quantum query algorithm, partial Boolean function, Science, Astrophysics, QB460-466, Physics, QC1-999

Popis souboru: electronic resource

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

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

The Complexity of the Representation of Multiple-Output Boolean Functions

Autoři: S. Vinokurov A. Frantseva

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

Témata: boolean function, Shannon function, complexity, Toffoli gates, reversible circuits, Reed-Muller forms, Mathematics, QA1-939

Popis souboru: electronic resource

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

Přístupová URL adresa: 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.

Autoři: Paul E. Dunne G.F. Nwana Paul H. Leng

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: Sun, Xiaoming Sun, Yuan Wu, Kewen a další

Témata: Energy complexity, Decision tree, Boolean function, Circuit complexity, Artificial Intelligence & Image Processing

Přístupová URL adresa: https://escholarship.org/uc/item/65k182vj

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

Autoři: Srinivasan, Srikanth Venkitesh, S. Srikanth Srinivasan and S. Venkitesh a další

Přispěvatelé: Srinivasan, Srikanth Venkitesh, S. Srikanth Srinivasan and S. Venkitesh a další

Zdroj: 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

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: BERNASCONI, ANNA

Zdroj: Calcolo. 35:149-186

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: GILMER, J SAKS, M SRINIVASAN, S

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

Témata: 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

Přístupová URL adresa: 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

Autoři: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat a další

Přispěvatelé: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat a další

Zdroj: 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

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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: Ajmal Beg Azam Beg P. W. Chandana Prasad

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

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

Popis souboru: text

Přístupová URL adresa: 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