Lower bounds for uniform read-once threshold formulae in the randomized decision tree model

03/31/2022
by   Nikos Leonardos, et al.
0

We investigate the randomized decision tree complexity of a specific class of read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, every internal node of which is labeled by a threshold function T_k^n (with output 1 only when at least k out of n input bits are 1) and each leaf by a distinct variable. Such a tree defines a Boolean function in a natural way. We focus on the randomized decision tree complexity of such functions, when the underlying tree is a uniform tree with all its internal nodes labeled by the same threshold function. We prove lower bounds of the form c(k,n)^d, where d is the depth of the tree. We also treat trees with alternating levels of AND and OR gates separately and show asymptotically optimal bounds, extending the known bounds for the binary case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2022

On (Simple) Decision Tree Rank

In the decision tree computation model for Boolean functions, the depth ...
research
12/31/2022

Power of Decision Trees with Monotone Queries

In this paper, we initiate study of the computational power of adaptive ...
research
04/29/2019

Asymmetric Impurity Functions, Class Weighting, and Optimal Splits for Binary Classification Trees

We investigate how asymmetrizing an impurity function affects the choice...
research
06/16/2018

Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits

We show average-case lower bounds for explicit Boolean functions again...
research
10/21/2018

Conflict complexity is lower bounded by block sensitivity

We show conflict complexity of any total boolean function, recently defi...
research
11/30/2022

Lifting to Parity Decision Trees Via Stifling

We show that the deterministic decision tree complexity of a (partial) f...
research
05/18/2023

Perspective on complexity measures targetting read-once branching programs

A model of computation for which reasonable yet still incomplete lower b...

Please sign up or login with your details

Forgot password? Click here to reset