Výsledky vyhľadávania - complexity of the parity function

Lower Bound of Circuit Complexity of Parity Function in a Basis of Unbounded Fan-In Autor Kombarov, Yu. A.

“…The paper is focused on the implementation of parity functions by circuits in the basis…”
Získať plný text

On the parity complexity measures of Boolean functions Autor Zhang, Zhiqiang, Shi, Yaoyun

“… We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement…”
Získať plný text

Unambiguous Parity‐Query Complexity Autor Gavinsky, Dmytro

“…‐query complexity of the approximate majority problem—that is, on the lowest randomized parity…”
Získať plný text

Complexity and Structure of Circuits for Parity Functions Autor Kombarov, Yu. A.

“…The paper is devoted to circuits implementing parity functions. A review of results establishing exact values of the complexity of parity functions is given…”
Získať plný text

Parity decision tree in classical–quantum separations for certain classes of Boolean functions Autor Mukherjee, Chandra Sekhar, Maitra, Subhamoy

“… ( Q E ) of several Boolean function classes using the parity decision tree method. We first define the query friendly (QF…”
Získať plný text

On Circuit Complexity of Parity and Majority Functions in Antichain Basis Autor Podolskaya, Olga

“… We prove that the circuit complexity of the parity function and the majority function of \(n\) variables in this basis…”
Získať plný text

The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model Autor Nissim, Kobbi, Yan, Chao

“… Namely, we show that the sample complexity of learning d-bit parity functions is Ω(2d/2). Our result extends a recent similar lowerbound on the sample complexity…”
Získať plný text

On the Decision Tree Complexity of Threshold Functions Autor Chistopolskaya, Anastasiya, Podolskii, Vladimir V.

“…In this paper we study decision tree models with various types of queries. For a given function it is usually not hard to determine the complexity in the standard decision tree model…”
Získať plný text

Difficulty of learning and generalization as a function of complexity, parity, and abstraction within two primitive Boolean families Autor Hammerly, Mark D

“…: complexity, which is a measure of the logical incompressibility of the Boolean function, and parity, which refers to the number exemplars placed in the positive category…”
Získať plný text

On the parity complexity measures of Boolean functions Autor Zhang, Zhiqiang, Shi, Yaoyun

“… We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement…”
Získať plný text

Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements Autor Kombarov, Yu. A.

“… ∞ . This basis contains all functions of the form . A method of construction of circuits for a parity function of n variables with the complexity is described…”
Získať plný text

Generalization properties of modular networks: implementing the parity function Autor Franco, L., Cannas, S.A.

“…The parity function is one of the most used Boolean function for testing learning algorithms because both of its simple definition and its great complexity…”
Získať plný text

A Composition Theorem for Parity Kill Number Autor O'Donnell, Ryan, Wright, John, Yu Zhao, Xiaorui Sun, Li-Yang Tan

“…In this work, we study the parity complexity measures C min ⊕ [f] and DT ⊕ [f]. C min ⊕ [f] is the parity kill number of f, the fewest number of parities on the input variables one has to fix in order to "kill" f…”
Získať plný text

Lifting to Parity Decision Trees Via Stifling Autor Chattopadhyay, Arkadev, Mande, Nikhil S, Sanyal, Swagato, Sherif, Suhail

“…\) lifts to the deterministic parity decision tree (PDT) size complexity of the composed function/relation \(f \circ g…”
Získať plný text

Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent Autor Yao, Penghui

“…In this note, we study the relation between the parity decision tree complexity of a boolean function \(f\), denoted by \(\mathrm{D}_{\oplus}(f)\), and the \(k…”
Získať plný text

Parity-Check Relations on Combination Generators Autor Canteaut, A., Naya-Plasencia, M.

“…) independent devices combined by a Boolean function. In particular, any parity-check relation derived from the periods of some constituent sequences usually leads to a distinguishing attack whose complexity is determined by the bias of the relation…”
Získať plný text

Unambiguous parity-query complexity Autor Gavinsky, Dmytro

“…We give a lower bound of \(\Omega(\sqrt n)\) on the unambiguous randomised parity-query complexity of the approximate majority problem -- that is, on the lowest randomised parity-query complexity of any function over \(\{0,1\}^n…”
Získať plný text

Reduced-complexity decoding of LDPC codes Autor Jinghu Chen, Dholakia, A., Eleftheriou, E., Fossorier, M.P.C., Xiao-Yu Hu

“…Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC…”
Získať plný text

Complexity of linear and majority functions in the basis of antichain functions Autor Podolskaya, O. V.

“… It is proved that the complexity of realization of an n -variable parity function is and the complexity of its negation equals the complexity of the n -variable majority…”
Získať plný text

Deep Polar Codes Autor Choi, Geon, Lee, Namyoon

“… Next, we put forth a low-complexity decoding algorithm called successive cancellation list with backpropagation parity checks (SCL-BPC…”
Získať plný text