scientific article; zbMATH DE number 2062211

zbMATH Open1061.68067MaRDI QIDQ4459079FDOQ4459079

Authors: Andris Ambainis, Rūsiņš Freivalds 

Publication date: 25 March 2004

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

Recommendations

• On the degree of Boolean functions as real polynomials
• Universal functions for classes of Boolean polynomials
• SOFSEM 2005: Theory and Practice of Computer Science
• An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
• The complexity of Boolean functions in different characteristics

zbMATH Keywords

decision tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (2)

• Boolean functions with low average sensitivity depend on few coordinates
• Universal functions for classes of Boolean polynomials

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