Pages that link to "Item:Q4612476"

The following pages link to Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476):

Displaying 9 items.

• Covering symmetric sets of the Boolean cube by affine hyperplanes (Q2138580) (← links)
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
• Certifying polynomials for AC^0(parity) circuits, with applications (Q2957479) (← links)
• 30th Conference on Computational Complexity (CCC 2015) (Q4601826) (← links)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
• Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
• Parity helps to compute majority (Q5091774) (← links)
• Separation of \(\mathrm{AC}^0[\oplus]\) formulas and circuits (Q5111381) (← links)
• A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)