scientific article; zbMATH DE number 522838

MaRDI QIDQ4284231zbMATHFDO

Authors Pavel Pudlák

Publication date 26 June 1994

zbMATH Keywords

circuit complexitydegree polynomialsFourier transform of Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4170847
• Certifying polynomials for AC^0(parity) circuits, with applications
• Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression
• scientific article; zbMATH DE number 3937108
• A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)

Cited in

(5)

• The polynomial method in circuit complexity applied to algorithm design (invited talk)
• scientific article; zbMATH DE number 7650382 (Why is no real title available?)
• A lower bound for primality
• Circuit complexity before the dawn of the new millennium
• scientific article; zbMATH DE number 6007880 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284231)