Suchergebnisse - Boolean function complexity*

Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order

Autoren: Abbott, Alastair Mhalla, Mehdi Pocreau, Pierre et al.

Weitere Verfasser: Abbott, Alastair Mhalla, Mehdi Pocreau, Pierre et al.

Quelle: Electronic Proceedings in Theoretical Computer Science. 426:270-300

Schlagwörter: Quantum Physics, FOS: Physical sciences, Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2506.05187
https://inria.hal.science/hal-05217422v1
https://inria.hal.science/hal-05217422v1/document
https://doi.org/10.4204/eptcs.426.11

Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight

Autoren: Li, Yuan Wu, Haowei Yang, Yi

Quelle: Lecture Notes in Computer Science ISBN: 9789819502141

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Zugangs-URL: http://arxiv.org/abs/2403.03530

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

Autoren: Walter, Matthias

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

Schlagwörter: QA1-939, Pseudo-Boolean optimization, multilinear optimization, Mathematics

Zugangs-URL: https://doaj.org/article/7eeb38dbd35248a1ad654d09d3f09c10

The Exact Circuit Complexity of Boolean Functions in an Infinite Basis.

Autoren: Kochergin, V. V. Mikhailovich, A. V.

Quelle: Mathematical Notes. Apr2025, Vol. 117 Issue 3, p579-594. 16p.

Schlagwörter: *CIRCUIT complexity, *BOOLEAN functions, *LOGIC circuits, *LOGIC

Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks.

Autoren: Carlet, Claude Sarkar, Palash

Quelle: Discrete Applied Mathematics. Oct2025, Vol. 373, p256-270. 15p.

Schlagwörter: *ARITHMETIC functions, *COMPUTATIONAL complexity, *BOOLEAN functions, *ARITHMETIC, *INTEGERS

Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions

Autoren: Mikhail A. Mestetskiy Mikhail S. Shupletsov

Quelle: Discrete Mathematics and Applications. 34:211-219

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

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

Autoren: Jansson, Julia Jansson, Patrik

Quelle: Journal of Functional Programming. 33

Dateibeschreibung: electronic

Zugangs-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

On circuit complexity of partial Boolean functions

Autoren: Alexander Viktorovich Chashkin

Quelle: Mathematical Problems of Cybernetics. :152-222

Estimating the Number of Junta Variables for Optimizing Boolean Functions in Quantum Memories.

Autoren: Alotaibi, Abdulaziz AbdelAzim, Samar Alharbi, Sattam Saleem et al.

Quelle: Mathematics (2227-7390). Nov2025, Vol. 13 Issue 21, p3400. 16p.

Schlagwörter: *QUANTUM computing, *TIME complexity, *BOOLEAN functions, *COMPUTER memory management, *QUANTUM computers, *QUANTUM entanglement

On the non-monotone complexity of Boolean and k-value logic functions

Autoren: Vadim Vasilievich Kochergin Anna Vitalievna Mihajlovich

Quelle: Mathematical Problems of Cybernetics. :51-151

On parity decision trees for Fourier-sparse Boolean functions

Autoren: Nikhil Shekhar Mande Swagato Sanyal Nikhil S. Mande and Swagato Sanyal

Weitere Verfasser: Nikhil Shekhar Mande Swagato Sanyal Nikhil S. Mande and Swagato Sanyal

Quelle: ACM Transactions on Computation Theory. 16:1-26

Schlagwörter: 0301 basic medicine, FOS: Computer and information sciences, Parity decision trees, 68Q11, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, log-rank conjecture, Computer Science - Computational Complexity, 03 medical and health sciences, 0202 electrical engineering, electronic engineering, information engineering, communication complexity, analysis of Boolean functions, ddc:004, F.1.1

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2008.00266
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.29

Query complexity of Boolean functions on the middle slice of the cube.

Autoren: Gerbner, Dániel Keszegh, Balázs Nagy, Dániel T. et al.

Quelle: Discrete Applied Mathematics. Feb2025, Vol. 362, p43-49. 7p.

Schlagwörter: *BOOLEAN functions, *CUBES

On the relationship between energy complexity and other boolean function measures

Autoren: Xiaoming Sun Yuan Sun Kewen Wu et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783030261757
Journal of Combinatorial Optimization, vol 43, iss 5

Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Mathematical Sciences, Computation Theory & Mathematics, Affordable and Clean Energy, Boolean function, Decision tree, FOS: Mathematics, Mathematics - Combinatorics, Artificial Intelligence & Image Processing, 0101 mathematics, Numerical and Computational Mathematics, Applied Mathematics, Pure mathematics, Applied mathematics, Pure Mathematics, Circuit complexity, Computer Science - Computational Complexity, Energy complexity, Combinatorics (math.CO), F.1.3, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/pdf/1810.03811
http://arxiv.org/abs/1810.03811
https://link.springer.com/article/10.1007/s10878-020-00689-8
https://rd.springer.com/chapter/10.1007/978-3-030-26176-4_43
https://dblp.uni-trier.de/db/journals/corr/corr1810.html#abs-1810-03811
https://link.springer.com/chapter/10.1007/978-3-030-26176-4_43
https://arxiv.org/abs/1810.03811
http://arxiv.org/pdf/1810.03811.pdf
https://escholarship.org/uc/item/65k182vj
https://escholarship.org/uc/item/63k3d6xt

On the Structure, Complexity, and Depth of the Circuits over the Basis {&, ∨} Realizing Step Boolean Functions

Autoren: S.A. Lozhkin D.S. Kinzhikeyeva

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

Schlagwörter: complexity and depth minimization, 4. Education, QA1-939, structure of minimal circuits, boolean circuits, 15. Life on land, basis {& ∨}, 7. Clean energy, step boolean functions, Mathematics

Zugangs-URL: https://doaj.org/article/94b1dcb9ac67462d908d24bff8e72006

Topological aspects of Boolean functions

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

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

Schlagwörter: Boolean function, circuit complexity, order complex, Betti number, simplicial sheaf

Dateibeschreibung: print

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

Average-case deterministic query complexity of boolean functions with fixed weight

Autoren: Li, Yuan Wu, Haowei Yang, Yi

Index Begriffe: Computer Science - Computational Complexity, text

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

Influence of a Set of Variables on a Boolean Function: Influence of a set of variables on a Boolean function

Autoren: Aniruddha Biswas Palash Sarkar

Quelle: SIAM Journal on Discrete Mathematics. 37:2148-2171

Schlagwörter: FOS: Computer and information sciences, influence, Computer Science - Cryptography and Security, bent functions, Computer Science - Information Theory, Information Theory (cs.IT), Walsh transform, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, auto-correlation, Junta, Computer Science - Computational Complexity, Fourier and Fourier-Stieltjes transforms on locally compact and other abelian groups, Boolean function, Fourier transform, 0202 electrical engineering, electronic engineering, information engineering, resilient functions, Boolean functions, Cryptography and Security (cs.CR)

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2107.08676
https://zbmath.org/7742539
https://doi.org/10.1137/22m1503531

on the complexity of computing a random boolean function over the reals

Autoren: Hrubeš, P. (Pavel)

Quelle: Theory of Computing. 16(1):1-12

Schlagwörter: quantifier elimination, random Boolean function

Zugangs-URL: https://cims.nyu.edu/~regev/toc/articles/v016a009/index.html
https://tocmirror.cs.uchicago.edu/articles/v016a009/
https://mirror.theoryofcomputing.org/articles/v016a009/
https://dblp.uni-trier.de/db/journals/toc/toc16.html#Hrubes20
https://tocbeta.cs.uchicago.edu/articles/v016a009/
http://hdl.handle.net/11104/0312602

Quantum and Classical Communication Complexity of Permutation-Invariant Functions

Autoren: Ziyi Guan Yunqi Huang Penghui Yao et al.

Weitere Verfasser: Ziyi Guan Yunqi Huang Penghui Yao et al.

Quelle: IEEE Transactions on Information Theory. 71:2782-2799

Schlagwörter: Quantum Physics, Computational Complexity, Communication complexity, ddc:004, Log-rank Conjecture, Permutation-invariant functions, Quantum advantages

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2401.00454
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.39

Quantum Advantages via Fourier Growth Analysis of Boolean Functions

Autoren: Wu, Kewen

Schlagwörter: Computer science, Mathematics, Quantum physics, Theoretical mathematics, Boolean function analysis, Communication complexity, Fourier analysis, Quantum-classical separation, Query complexity

Dateibeschreibung: application/pdf

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