Výsledky vyhledávání - Boolean function complexity theory*

THE APPROXIMATE DEGREE OF DNF AND CNF FORMULAS.

Autoři: SHERSTOV, ALEXANDER A.¹ sherstov@cs.ucla.edu

Zdroj: SIAM Journal on Computing. 2025, Vol. 54 Issue 3, p702-774. 73p.

Témata: BOOLEAN functions, COMMUNICATION complexity (Information theory), DISJUNCTION (Logic), BOOLEAN expressions, LOGIC circuits, DISCRETE mathematics, COMPUTATIONAL complexity

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

Boolean Functions: Theory, Algorithms, and Applications

Autoři: Crama, Yves Hammer, Peter L. QuantOM

Přispěvatelé: Crama, Yves Hammer, Peter L. QuantOM

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

Popis souboru: xxi, 687

Relation: Encyclopedia of Mathematics and its Applications 142

Přístupová URL adresa: https://orbi.uliege.be/handle/2268/72714

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

CONSTANT DEPTH FORMULA AND PARTIAL FUNCTION VERSIONS OF MCSP ARE HARD.

Autoři: ILANGO, RAHUL¹ rilango@mit.edu

Zdroj: SIAM Journal on Computing. 2024, Vol. 53 Issue 6, p317-367. 51p.

Témata: *CRYPTOGRAPHY, CIRCUIT complexity, BOOLEAN functions, HYPOTHESIS, MOTIVATION (Psychology)

Multiplicative Complexity of XOR Based Regular Functions.

Autoři: Bernasconi, Anna Cimato, Stelvio Ciriani, Valentina a další

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

Témata: *TECHNOLOGICAL innovations, BOOLEAN functions, LOGIC design, LOGIC circuits

Method of restoring multivariable Boolean function from its derivative

Autoři: Alexander V. Mazurenko Nadezhda S. Mogilevskaya

Zdroj: Advanced Engineering Research, Vol 17, Iss 1, Pp 122-131 (2017)

Témata: булева функция, производная булевой функции по направлению, алгоритм проверки возможности восстановления булевой функции, оценка сложности, пространство булевых функций, кольцо многочленов, конечные поля, кольцевой изоморфизм, теория кодирования, поиск прообраза, boolean function, directional derivative of boolean function, algorithm of checking recoverability of boolean function, complexity estimation, space of boolean functions, polynomial ring, finite fields, ring isomorphism, coding theory, preimage searching, Materials of engineering and construction. Mechanics of materials, TA401-492

Popis souboru: electronic resource

Relation: https://www.vestnik-donstu.ru/jour/article/view/254; https://doaj.org/toc/2687-1653

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

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

Autoři: SHERSTOV, ALEXANDER A.¹ sherstov@cs.ucla.edu

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

Témata: BOOLEAN functions, COMMUNICATION complexity (Information theory)

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

Přispěvatelé: Crama, Yves Hammer, Peter L. QuantOM

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

Popis souboru: 776

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

Přístupová URL adresa: https://orbi.uliege.be/handle/2268/61250

Representing Symmetric Boolean Functions with Polynomial over Composite Moduli.

Autoři: SHI-CHUN TSAI MING-CHUAN YANG

Zdroj: Journal of Information Science & Engineering. Jan2018, Vol. 34 Issue 1, p193-203. 11p.

Témata: Boolean functions, Computational complexity, Polynomial time algorithms, Mathematical optimization, Galois theory

Sensitivity, block sensitivity, and ℓ-block sensitivity of boolean functions: Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions

Autoři: Claire Kenyon Samuel Kutin

Zdroj: Information and Computation. 189:43-53

Témata: Computational Theory and Mathematics, Boolean function complexity, Analysis of algorithms and problem complexity, block sensitivity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Boolean functions, sensitivity, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

Popis souboru: application/xml

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

Autoři: Ingo Wegener

Zdroj: Theoretical Computer Science. 85:155-170

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

Popis souboru: application/xml

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

Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $: Lower bounds on representing boolean functions as polynomials in \(Z_ m\)

Autoři: Shi-Chun Tsai

Zdroj: SIAM Journal on Discrete Mathematics. 9:55-62

Témata: computational complexity, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, boolean function complexity, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, 01 natural sciences, circuit complexity

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/869822
https://doi.org/10.1137/s0895480193255505
https://epubs.siam.org/doi/abs/10.1137/S0895480193255505?cookieSet=1
https://dblp.uni-trier.de/db/journals/siamdm/siamdm9.html#Tsai96
https://dl.acm.org/doi/10.1137/S0895480193255505

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

Certificate Games

Autoři: Chakraborty, Sourav Gál, Anna Laplante, Sophie a další

Přispěvatelé: Chakraborty, Sourav Gál, Anna Laplante, Sophie a další

Témata: certificate complexity, zero-communication two-player games, boolean function complexity, block sensitivity, Theory of computation → Quantum query complexity, query complexity, [INFO] Computer Science [cs], ddc:004, sensitivity, Theory of computation → Computational complexity and cryptography, Theory of computation → Circuit complexity

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.32

A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions.

Autoři: Kumar, Sunil Singh, Harshdeep Mittal, Gaurav

Zdroj: International Journal of Foundations of Computer Science. Aug2022, Vol. 33 Issue 5, p453-479. 27p.

Témata: BOOLEAN functions, DISCRETE Fourier transforms, CODING theory, FOURIER transforms

Sensitivity metrics of complex network based on co-occurrence truth table: exemplified by a high-speed rail network.

Autoři: Luo, Juanjuan Fei, Teng Tian, Meng a další

Zdroj: Journal of Geographical Systems. Oct2023, Vol. 25 Issue 4, p519-538. 20p.

Témata: *MONTE Carlo method, COMPLEXITY (Philosophy), BOOLEAN functions

Geografický termín: CHINA

Upper Bounds on Communication in Terms of Approximate Rank.

Autoři: Gál, Anna Syed, Ridwan

Zdroj: Theory of Computing Systems. Oct2024, Vol. 68 Issue 5, p1109-1123. 15p.

Témata: *QUANTUM computing, *COINS, QUANTUM communication, BOOLEAN functions

On the Complexity of the Clone Membership Problem.

Autoři: Jeřábek, Emil¹ (AUTHOR) jerabek@math.cas.cz

Zdroj: Theory of Computing Systems. Jul2021, Vol. 65 Issue 5, p839-868. 30p.

Témata: BOOLEAN functions, NP-complete problems, SET functions

The Influence of Oppositely Classified Examples on the Generalization Complexity of Boolean Functions.

Autoři: Franco, Leonardo Anthony, Martin

Zdroj: IEEE Transactions on Neural Networks. May2006, Vol. 17 Issue 3, p578-590. 13p. 2 Diagrams, 2 Charts, 6 Graphs.

Témata: *ARTIFICIAL neural networks, COMPUTATIONAL complexity, BOOLEAN algebra, SENSITIVITY theory (Mathematics), SYMMETRIC functions