An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,

2013 ◽  
pp. 696-708
Author(s):  
Nikos Leonardos
Keyword(s):  
Lower Bound ◽  
Decision Tree ◽  
Decision Tree Complexity

Gems in decision tree complexity revisited

2013 ◽  
Vol 44 (3) ◽  
pp. 42-55
Author(s):  
Raghav Kulkarni
Keyword(s):  
Decision Tree ◽  
Decision Tree Complexity

scholarly journals Distribution-sensitive set multi-partitioning

2005 ◽  
Vol DMTCS Proceedings vol. AD,... (Proceedings) ◽  
Author(s):  
Amr Elmasry
Keyword(s):  
Lower Bound ◽  
Decision Tree ◽  
Decision Tree Model ◽  
Tree Model ◽  
Different Types ◽  
International Audience ◽  
Partitioning Problem

International audience Given a set $\mathcal{S}$ with real-valued members, associated with each member one of two possible types; a multi-partitioning of $\mathcal{S}$ is a sequence of the members of $\mathcal{S}$ such that if $x,y \in \mathcal{S}$ have different types and $x < y$, $x$ precedes $y$ in the multi-partitioning of $\mathcal{S}$. We give two distribution-sensitive algorithms for the set multi-partitioning problem and a matching lower bound in the algebraic decision-tree model. One of the two algorithms can be made stable and can be implemented in place. We also give an output-sensitive algorithm for the problem.

scholarly journals Circuit and Decision Tree Complexity of Some Number Theoretic Problems

2001 ◽  
Vol 168 (2) ◽  
pp. 113-124 ◽  
Author(s):  
Anna Bernasconi ◽  
Carsten Damm ◽  
Igor Shparlinski
Keyword(s):  
Decision Tree ◽  
Decision Tree Complexity
Sign in / Sign up

Export Citation Format

Share Document