scholarly journals On (Valiant’s) Polynomial-Size Monotone Formula for Majority

2020 ◽  
pp. 17-23
Author(s):  
Oded Goldreich
Keyword(s):  
Polynomial Size ◽  
Monotone Formula

scholarly journals Polynomial size test sets for commutative languages

1997 ◽  
Vol 31 (3) ◽  
pp. 291-304 ◽  
Author(s):  
Ismo Hakala ◽  
Juha Kortelainen
Keyword(s):  
Polynomial Size ◽  
Test Sets

scholarly journals Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1162
Author(s):  
Khaled A. AL-Utaibi ◽  
Sadiq H. Abdulhussain ◽  
Basheera M. Mahmmod ◽  
Marwah Abdulrazzaq Naser ◽  
Muntadher Alsabah ◽  
...  
Keyword(s):  
Recurrence Relation ◽  
Coding Theory ◽  
State Of The Art ◽  
Reconstruction Error ◽  
Krawtchouk Polynomials ◽  
Polynomial Size ◽  
Main Challenge ◽  
Recurrence Algorithm ◽  
Symmetry Relations ◽  
Parameter Values

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.

Lower Bounds on OBDD Proofs with Several Orders

2021 ◽  
Vol 22 (4) ◽  
pp. 1-30
Author(s):  
Sam Buss ◽  
Dmitry Itsykson ◽  
Alexander Knop ◽  
Artur Riazanov ◽  
Dmitry Sokolov
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Communication Complexity ◽  
Multiparty Communication ◽  
Constant Degree ◽  
Polynomial Size ◽  
Explicit Constant ◽  
Open Question ◽  
System 1 ◽  
Exponential Size

This article is motivated by seeking lower bounds on OBDD(∧, w, r) refutations, namely, OBDD refutations that allow weakening and arbitrary reorderings. We first work with 1 - NBP ∧ refutations based on read-once nondeterministic branching programs. These generalize OBDD(∧, r) refutations. There are polynomial size 1 - NBP(∧) refutations of the pigeonhole principle, hence 1-NBP(∧) is strictly stronger than OBDD}(∧, r). There are also formulas that have polynomial size tree-like resolution refutations but require exponential size 1-NBP(∧) refutations. As a corollary, OBDD}(∧, r) does not simulate tree-like resolution, answering a previously open question. The system 1-NBP(∧, ∃) uses projection inferences instead of weakening. 1-NBP(∧, ∃ k is the system restricted to projection on at most k distinct variables. We construct explicit constant degree graphs G n on n vertices and an ε > 0, such that 1-NBP(∧, ∃ ε n ) refutations of the Tseitin formula for G n require exponential size. Second, we study the proof system OBDD}(∧, w, r ℓ ), which allows ℓ different variable orders in a refutation. We prove an exponential lower bound on the complexity of tree-like OBDD(∧, w, r ℓ ) refutations for ℓ = ε log n , where n is the number of variables and ε > 0 is a constant. The lower bound is based on multiparty communication complexity.

Analysis of secret sharing schemes based on Nielsen transformations

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Matvei Kotov ◽  
Dmitry Panteleev ◽  
Alexander Ushakov
Keyword(s):  
Computer Algebra ◽  
Secret Sharing ◽  
Computer Algebra System ◽  
Cryptographic Protocols ◽  
Secret Sharing Schemes ◽  
Polynomial Equations ◽  
Polynomial Size ◽  
Security Properties ◽  
System Of Polynomial Equations

Abstract We investigate security properties of two secret-sharing protocols proposed by Fine, Moldenhauer, and Rosenberger in Sections 4 and 5 of [B. Fine, A. Moldenhauer and G. Rosenberger, Cryptographic protocols based on Nielsen transformations, J. Comput. Comm. 4 2016, 63–107] (Protocols I and II resp.). For both protocols, we consider a one missing share challenge. We show that Protocol I can be reduced to a system of polynomial equations and (for most randomly generated instances) solved by the computer algebra system Singular. Protocol II is approached using the technique of Stallings’ graphs. We show that knowledge of {m-1} shares reduces the space of possible values of a secret to a set of polynomial size.

scholarly journals Fixed-Polynomial Size Circuit Bounds

2009 ◽  
Author(s):  
Lance Fortnow ◽  
Rahul Santhanam ◽  
Ryan Williams
Keyword(s):  
Polynomial Size

TOWARD RANDOMIZED TESTING OF q-MONOMIALS IN MULTIVARIATE POLYNOMIALS

2014 ◽  
Vol 06 (02) ◽  
pp. 1450016
Author(s):  
SHENSHI CHEN ◽  
YAQING CHEN ◽  
QUANHAI YANG
Keyword(s):  
Time Complexity ◽  
Multivariate Polynomials ◽  
Multivariate Polynomial ◽  
Fixed Integer ◽  
Polynomial Size

Given any fixed integer q ≥ 2, a q-monomial is of the format [Formula: see text] such that 1 ≤ sj ≤ q - 1, 1 ≤ j ≤ t. q-monomials are natural generalizations of multilinear monomials. Recent research on testing multilinear monomials and q-monomials for prime q in multivariate polynomials relies on the property that Zq is a field when q ≥ 2 is prime. When q > 2 is not prime, it remains open whether the problem of testing q-monomials can be solved in some compatible complexity. In this paper, we present a randomized O*(7.15k) algorithm for testing q-monomials of degree k that are found in a multivariate polynomial that is represented by a tree-like circuit with a polynomial size, thus giving a positive, affirming answer to the above question. Our algorithm works regardless of the primality of q and improves upon the time complexity of the previously known algorithm for testing q-monomials for prime q > 7.

Sign in / Sign up

Export Citation Format

Share Document