scientific article; zbMATH DE number 176776

zbMATH Open0769.68044MaRDI QIDQ4036606FDOQ4036606

Authors: Hans Dietmar Gröger, Gy. Turán 

Publication date: 18 May 1993

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

Recommendations

• Lower bounds for linear decision trees with bounded weights
• Lower bounds for linear decision trees via an energy complexity argument
• scientific article; zbMATH DE number 741345
• Decision trees with Boolean threshold queries
• Bounds on the depth of decision trees that compute Boolean functions

zbMATH Keywords

randomizationerror probabilitylinear decision treesinner product \(\mod 2\) of two \(n\)-bit vectors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Cited In (13)

• Lower bounds for linear decision trees with bounded weights
• On the power of circuits with gates of low \(L_{1}\) norms.
• Title not available (Why is that?)
• Lower bounds for linear decision lists
• Title not available (Why is that?)
• Decision trees with Boolean threshold queries
• Linear threshold functions in decision lists, decision trees, and depth-2 circuits
• Title not available (Why is that?)
• On the Decision Tree Complexity of Threshold Functions
• Nearest neighbor representations of Boolean functions
• Title not available (Why is that?)
• On the decision tree complexity of threshold functions
• Lower bounds for linear decision trees via an energy complexity argument

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