Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
On read-once threshold formulae and their randomized decision tree complexity
Rafi Heiman
,
Ilan Newman
, Avi Wigderson
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On read-once threshold formulae and their randomized decision tree complexity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Randomized Decision Trees
100%
Decision Tree Complexity
100%
Threshold Formula
100%
Read-once
100%
Decision Tree
50%
Class Function
50%
Threshold Circuits
50%
Tight
25%
Computable
25%
Structural Results
25%
Models of Computation
25%
First-in-class
25%
Exactly-once
25%
Constant Depth
25%
Threshold Gate
25%
Threshold Decision
25%
Depth Formula
25%
Mathematics
Decision Tree
100%
Main Result
25%
Polynomial
25%
Computable Function
25%
Model of Computation
25%
Computer Science
Decision Tree
100%
Computable Function
25%
Model of Computation
25%
Subclasses
25%