Suchergebnisse - Boolean function complexity theory

Boolean Functions: Theory, Algorithms, and Applications

Autoren: Crama, Yves Hammer, Peter L. QuantOM

Weitere Verfasser: Crama, Yves Hammer, Peter L. QuantOM

Schlagwörter: Boolean functions, propositional logic, satisfiability, graph theory, electrical engineering, reliability, simple games, computational complexity, circuits, pseudo-Boolean functions, artificial intelligence, duality, integer programming, combinatorial optimization, Engineering, computing & technology, Computer science, Electrical & electronics engineering, Business & economic sciences, Quantitative methods in economics & management, Physical, chemical, mathematical & earth Sciences, Mathematics, Ingénierie, informatique & technologie, Sciences informatiques, Ingénierie électrique & électronique, Sciences économiques & de gestion, Méthodes quantitatives en économie & gestion, Physique, chimie, mathématiques & sciences de la terre, Mathématiques

Dateibeschreibung: xxi, 687

Relation: Encyclopedia of Mathematics and its Applications 142

Zugangs-URL: https://orbi.uliege.be/handle/2268/72714

Interplay between resiliency and polynomial degree — Recursive amplification, higher order sensitivity and beyond.

Autoren: Maitra, Subhamoy Mukherjee, Chandra Sekhar Stănică, Pantelimon et al.

Quelle: Discrete Applied Mathematics. Apr2025, Vol. 365, p138-159. 22p.

Schlagwörter: *BOOLEAN functions, *CODING theory, *COMPLEXITY (Philosophy), *CRYPTOGRAPHY, *POLYNOMIALS

Multiplicative Complexity of XOR Based Regular Functions.

Autoren: Bernasconi, Anna Cimato, Stelvio Ciriani, Valentina et al.

Quelle: IEEE Transactions on Computers. Nov2022, Vol. 71 Issue 11, p2927-2939. 13p.

Schlagwörter: *BOOLEAN functions, *TECHNOLOGICAL innovations, *LOGIC design, *LOGIC circuits

STRONG ISOMORPHISM REDUCTIONS IN COMPLEXITY THEORY

Autoren: BUSS, SAM CHEN, YIJIA FLUM, JÖRG et al.

Quelle: The Journal of Symbolic Logic, 2011 Dec 01. 76(4), 1381-1402.

Zugangs-URL: http://dx.doi.org/10.2178/jsl/1318338855

Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function

Autoren: Chukhin, Nikolai Kulikov, Alexander S. Mihajlin, Ivan et al.

Weitere Verfasser: Chukhin, Nikolai Kulikov, Alexander S. Mihajlin, Ivan et al.

Schlagwörter: complexity, formula complexity, lower bounds, Boolean functions, depth

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.26

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.STACS.2025.26
https://nbn-resolving.org/urn:nbn:de:0030-drops-228513
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.26

A Coding Theoretic Approach towards Symmetrization in Reversible Circuit Synthesis.

Autoren: BAKSI, ANUBHAB SARKAR, SUMANTA CHATTOPADHYAY, ANUPAM

Quelle: Journal of Multiple-Valued Logic & Soft Computing; 2020, Vol. 35 Issue 3/4, p239-262, 24p

Schlagwörter: BOOLEAN functions, LOGIC design, CIRCUIT complexity, SYMMETRIC functions, CODING theory

BREAKING THE MINSKY-PAPERT BARRIER FOR CONSTANT-DEPTH CIRCUITS.

Autoren: SHERSTOV, ALEXANDER A.¹ sherstov@cs.ucla.edu

Quelle: SIAM Journal on Computing. 2018, Vol. 47 Issue 5, p1809-1857. 49p.

Schlagwörter: BOOLEAN functions, COMMUNICATION complexity (Information theory)

Goldbach Conjecture C: Quantum Random Walk and Boolean Function Analysis of the Provability of the Goldbach Conjecture

Autoren: zhou, changzheng orcid:0009-0002-4186- ZHOU, ziqing

Schlagwörter: Goldbach conjecture, quantum random walk, Boolean function analy sis, quantum information, computational complexity, influence theorem, quantum query complexity, prime number determination, quantum simulation, quantum algorithm

Relation: https://zenodo.org/records/17212023; oai:zenodo.org:17212023; https://doi.org/10.5281/zenodo.17212023

Verfügbarkeit: https://doi.org/10.5281/zenodo.17212023
https://zenodo.org/records/17212023

Boolean Models and Methods in Mathematics, Computer Science, and Engineering

Weitere Verfasser: Crama, Yves Hammer, Peter L. QuantOM

Schlagwörter: Boolean functions, logic, learning theory, cryptography, computational complexity, electrical engineering, reliability, Engineering, computing & technology, Computer science, Physical, chemical, mathematical & earth Sciences, Mathematics, Electrical & electronics engineering, Ingénierie, informatique & technologie, Sciences informatiques, Physique, chimie, mathématiques & sciences de la terre, Mathématiques, Ingénierie électrique & électronique

Dateibeschreibung: 776

Relation: Encyclopedia of Mathematics and its Applications (No. 134)

Zugangs-URL: https://orbi.uliege.be/handle/2268/61250

The complexity of the parity function in unbounded fan-in, unbounded depth circuits

Autoren: Ingo Wegener

Quelle: Theoretical Computer Science. 85:155-170

Schlagwörter: unbounded fan-in Boolean circuits, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, Boolean function complexity theory, 0102 computer and information sciences, complexity measure, 0101 mathematics, 01 natural sciences, complexity of the parity function, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/33394
https://doi.org/10.1016/0304-3975(91)90052-4
https://dblp.uni-trier.de/db/journals/tcs/tcs85.html#Wegener91
https://www.sciencedirect.com/science/article/abs/pii/0304397591900524
https://www.sciencedirect.com/science/article/pii/0304397591900524
https://core.ac.uk/display/82172673

Relativizations of the P = ? NP and Other Problems: Developments in Structural Complexity Theory

Autoren: Book, Ronald V.

Quelle: SIAM Review, 1994 Jun 01. 36(2), 157-175.

Zugangs-URL: https://www.jstor.org/stable/2132459

A Note on the LogRank Conjecture in Communication Complexity.

Autoren: Grolmusz, Vince

Quelle: Mathematics (2227-7390); Nov2023, Vol. 11 Issue 22, p4651, 10p

Schlagwörter: COMPOSITE numbers, BOOLEAN matrices, LOGICAL prediction, BOOLEAN functions, COMPLEXITY (Philosophy)

A Few Exercises on the Complexity of Congruence Closure with Cardinality Constraints (Extended Abstract)

Autoren: Dasnois, Louis Fontaine, Pascal Montefiore Institute - Montefiore Institute of Electrical Engineering and Computer Science - ULiège

Weitere Verfasser: Dasnois, Louis Fontaine, Pascal Montefiore Institute - Montefiore Institute of Electrical Engineering and Computer Science - ULiège

Quelle: CEUR Workshop Proceedings, 4008, 59–64 (2025-08-07); 23rd International Workshop on Satisfiability Modulo Theories, Glasgow, United Kingdom [GB], August 10–11, 2025

Schlagwörter: cardinality constraints, congruence closure, disequality propagation, EUF, EUF + FCC, finite domains, NP-completeness, Engineering, computing & technology, Computer science, Ingénierie, informatique & technologie, Sciences informatiques

Relation: https://ceur-ws.org/Vol-4008/; urn:issn:1613-0073

Zugangs-URL: https://orbi.uliege.be/handle/2268/335359

Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function

Autoren: Nikolai Chukhin and Alexander S. Kulikov and Ivan Mihajlin Chukhin, Nikolai Kulikov, Alexander S. et al.

Index Begriffe: complexity, formula complexity, lower bounds, Boolean functions, depth, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.26
Is Part Of LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)

The Error Linear Complexity Spectrum as a Cryptographic Criterion of Boolean Functions.

Autoren: Limniotis, Konstantinos Kolokotronis, Nicholas

Quelle: IEEE Transactions on Information Theory. Dec2019, Vol. 65 Issue 12, p8345-8356. 12p.

Schlagwörter: *BOOLEAN functions, *HAMMING distance, *BINARY sequences, *SET functions, *CRYPTOGRAPHY, *APPROXIMATION algorithms

An $n \log n$ Lower Bound on Synchronous Combinational Complexity

Autoren: Harper, L. H.

Quelle: Proceedings of the American Mathematical Society, 1977 Jun 01. 64(2), 300-306.

Zugangs-URL: https://www.jstor.org/stable/2041447

On Boolean Functions with Low Polynomial Degree and Higher Order Sensitivity

Autoren: Maitra, Subhamoy Mukherjee, Chandra Sekhar Stanica, Pantelimon et al.

Index Begriffe: Computer Science - Computational Complexity, Computer Science - Cryptography and Security, text

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

Borel Complexity of Isomorphism between Quotient Boolean Algebras

Autoren: Gao, Su Oliver, Michael Ray

Quelle: The Journal of Symbolic Logic, 2008 Dec 01. 73(4), 1328-1340.

Zugangs-URL: https://www.jstor.org/stable/27590335

Delineating Classes of Computational Complexity via Second Order Theories with Weak Set Existence Principles. I

Autoren: Ignjatović, Aleksandar

Quelle: The Journal of Symbolic Logic, 1995 Mar 01. 60(1), 103-121.

Zugangs-URL: https://www.jstor.org/stable/2275511

DENSITY OF SMOOTH BOOLEAN FUNCTIONS

Autoren: Ratsaby, Joel

Quelle: Applicable Analysis and Discrete Mathematics, 2007 Jan 01. 1(1), 184-198.

Zugangs-URL: https://www.jstor.org/stable/43666045