Pages that link to "Item:Q1346617"

The following pages link to Representing Boolean functions as polynomials modulo composite numbers (Q1346617):

Displaying 33 items.

• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials (Q285507) (← links)
• A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
• Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
• Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
• Pairs of codes with prescribed Hamming distances and coincidences (Q851769) (← links)
• Relations among MOD-classes (Q914370) (← links)
• Representation of Boolean functions by arithmetic polynomials (Q1173077) (← links)
• A lower bound on the MOD 6 degree of the OR function (Q1272657) (← links)
• Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
• Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
• \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
• On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
• Standard monomials for \(q\)-uniform families and a conjecture of Babai and Frankl (Q1407186) (← links)
• Boolean functions: degree and support (Q1616170) (← links)
• Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
• Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
• Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
• Predicate encryption from bilinear maps and one-sided probabilistic rank (Q2175910) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
• Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
• Co-orthogonal codes (Q2491276) (← links)
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
• The Iota-Delta Function as an Alternative to Boolean Formalism (Q4640341) (← links)
• On the correlation of symmetric functions (Q4717052) (← links)
• On the correlation of symmetric functions (Q4879208) (← links)
• Parity helps to compute majority (Q5091774) (← links)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
• (Q5874535) (← links)
• On the modulo degree complexity of Boolean functions (Q5918108) (← links)
• Approximate evaluations of characteristic polynomials of Boolean functions (Q5958111) (← links)
• Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
• Complexity of modular circuits (Q6649462) (← links)