Pages that link to "Item:Q1208407"

The following pages link to On read-once threshold formulae and their randomized decision tree complexity (Q1208407):

Displaying 9 items.

• Competitive evaluation of threshold functions in the priced information model (Q646704) (← links)
• Randomized vs. deterministic decision tree complexity for read-once Boolean functions (Q685705) (← links)
• An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
• Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
• Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
• Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
• On linear rewriting systems for Boolean logic and some applications to proof theory (Q2974793) (← links)
• Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
• Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)