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?)

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

Recommendations

• Certifying polynomials for AC^0(parity) circuits, with applications 👍 👎
• A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)