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

The Error Linear Complexity Spectrum as a Cryptographic Criterion of Boolean Functions Autor Limniotis, Konstantinos, Kolokotronis, Nicholas

“… to be modified per period increases. In this paper, via defining an association between <inline-formula> <tex-math notation="LaTeX">2^{n} </tex-math></inline-formula>-periodic binary sequences and Boolean functions…”
Získat plný text

Toward a theory of one -way functions via gate complexity of Boolean functions Autor Interlando, J Carmelo

“… (or circuit) complexity of Boolean functions. The computational security of public-key cryptographic systems depends fundamentally on trapdoor one-way functions…”
Získat plný text

Monomial Boolean functions with large high-order nonlinearities Autor Gao, Jinjie, Kan, Haibin, Li, Yuan, Xu, Jiahua, Wang, Qichun

“…Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity…”
Získat plný text

Almost-natural proofs Autor Chow, Timothy Y.

“… ) that exclude P / poly . This famous result is widely regarded as a serious barrier to proving strong lower bounds in circuit complexity theory, because virtually all Boolean function properties used in existing lower bound…”
Získat plný text

Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory Autor Freivalds, R., Garkaje, L.

“… Unfortunately, it is a well-known problem to construct such functions. The best separation between these two complexity measures of a Boolean function was exhibited by Ambai- nis [5…”
Získat plný text

AN ABSTRACT COMPLEXITY THEORY FOR BOOLEAN FUNCTIONS Autor KOOB, GARY MICHAEL

“…Traditional theories measure the complexity of a function as a lower bound on the cost of its implementation…”
Získat plný text

A Note on the LogRank Conjecture in Communication Complexity Autor Grolmusz, Vince

“…The LogRank conjecture of Lovász and Saks (1988) is the most famous open problem in communication complexity theory…”
Získat plný text

Boolean functional synthesis: hardness and practical algorithms Autor Akshay, S., Chakraborty, Supratik, Goel, Shubham, Kulal, Sumith, Shah, Shetal

“… In trying to understand this behaviour, we show that unless some hard conjectures in complexity theory are falsified, Boolean functional synthesis must generate large Skolem functions in the worst-case…”
Získat plný text

Interplay between resiliency and polynomial degree — Recursive amplification, higher order sensitivity and beyond Autor Maitra, Subhamoy, Mukherjee, Chandra Sekhar, Stănică, Pantelimon, Tang, Deng

“…Boolean functions are important primitives in different domains of cryptology, complexity and coding theory, and far beyond in different areas of science and technology…”
Získat plný text

Sensitivity versus block sensitivity of Boolean functions Autor Virza, Madars

“…Determining the maximal separation between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory…”
Získat plný text

The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis Autor Vollmer, Heribert

“…We study the complexity of the following algorithmic problem: Given a Boolean function f and a finite set of Boolean functions B , decide if there is a circuit with basis B that computes  f…”
Získat plný text

Necessary and sufficient conditions for Boolean satisfiability Autor Margaryan, Stepan G

“… The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to transform any Boolean function in conjunctive normal form into a specific form…”
Získat plný text

Discrete Mathematics for Computer Science: An Example-Based Introduction Autor Fortney, Jon Pierre

“… It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics…”
Získat plný text

Lower Bounds on Stabilizer Rank Autor Peleg, Shir, Shpilka, Amir, Ben Lee Volk

“…The stabilizer rank of a quantum state \(\psi\) is the minimal \(r\) such that \(\left| \psi \right \rangle = \sum_{j=1}^r c_j \left|\varphi_j \right\rangle\)…”
Získat plný text

Block sensitivity of minterm-transitive functions Autor Drucker, Andrew

“…Boolean functions with a high degree of symmetry are interesting from a complexity theory perspective…”
Získat plný text

On covering graphs by complete bipartite subgraphs Autor Jukna, S., Kulikov, A.S.

“… We also formulate several open problems about covering problems for graphs whose solution would have important consequences in the complexity theory of boolean…”
Získat plný text

Lower Bounds on Stabilizer Rank Autor Peleg, Shir, Shpilka, Amir, Volk, Ben Lee

“… rank.Our techniques rely on the representation of stabilizer states as quadratic functions…”
Získat plný text

Digital Learning Characteristics and Principles of Information Resources Knowledge Structuring Autor Belichenko, Margarita, Davidovitch, Nitza, Kravchenko, Yuri

“…Analysis of principles knowledge representation in information systems led to the necessity of improving the structuring knowledge. It is caused by the…”
Získat plný text

Measuring Area-Complexity Using Boolean Difference Autor Kagliwal, A., Balachandran, S.

“… In this paper, we propose a novel area-complexity measure using the theory of Boolean difference and Taylor expansion for Boolean functions…”
Získat plný text

Information processing in dendrites: II. Information theoretic complexity Autor Gurney, Kevin N

“…In the companion paper, we established a rationale for exploring the general principles of dendritic processing using a class of Boolean functions…”
Získat plný text