scientific article; zbMATH DE number 1775396

MaRDI QIDQ4542529zbMATH OpenFDO

Authors Richard Beigel, Tirza Hirst

Publication date 1 August 2002

zbMATH Keywords

Boolean function

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The computational power of a family of decision forests
• Products and Help Bits in Decision Trees
• On linear decision trees computing Boolean functions
• The value of help bits in randomized and average-case complexity
• The cost of the missing bit: Communication complexity with help

Cited in

(5)

• The value of help bits in randomized and average-case complexity
• Products and Help Bits in Decision Trees
• The computational power of a family of decision forests
• The communication complexity of enumeration, elimination, and selection
• Choosing, agreeing, and eliminating in communication complexity

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