Pages that link to "Item:Q1095871"
From MaRDI portal
The following pages link to Lower bounds on the size of bounded depth circuits over a complete basis with logical addition (Q1095871):
Displaying 50 items.
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- Top-down lower bounds for depth-three circuits (Q1904663) (← links)
- Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
- Parametric equations in free groups (Q1916659) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\) (Q2056692) (← links)
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems (Q2065761) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Upper bound for torus polynomials (Q2117095) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Fine-grained secure attribute-based encryption (Q2139633) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case (Q2151382) (← links)
- Non-interactive zero-knowledge proofs with fine-grained security (Q2170050) (← links)
- Skew circuits of small width (Q2173307) (← links)
- Word equations in non-deterministic linear space (Q2237894) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- Implicit function theorem over free groups. (Q2386057) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Block-symmetric polynomials correlate with parity better than symmetric (Q2410677) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Using the renormalization group to classify Boolean functions (Q2482277) (← links)
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
- On the computational power of probabilistic and quantum branching program (Q2581534) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- Two-variable word equations (Q2729626) (← links)
- Solution sets for equations over free groups are EDT0L languages (Q2821818) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Anti-concentration for polynomials of independent random variables (Q2830871) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
