scientific article; zbMATH DE number 522838

zbMATH Open0790.94029MaRDI QIDQ4284231FDOQ4284231

Pavel Pudlák

Publication date: 26 June 1994

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• 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\)

zbMATH Keywords

circuit complexitydegree polynomialsFourier transform of Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A lower bound for primality

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)