scientific article; zbMATH DE number 432831

zbMATH Open0819.11067MaRDI QIDQ3138965FDOQ3138965

Michael Luby, Marek Karpinski

Publication date: 20 October 1993

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

zbMATH Keywords

finite fieldcircuit complexitynumber of zerosmultivariate polynomialMonte Carlo approximationprobabilistic polynomial time algorithmDNF counting problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Cited In (1)

• A \(q\)-analog of approximation inclusion-exclusion

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