research article text
oaioai:drops-oai.dagstuhl.de:22891

The Hardness of Decision Tree Complexity

Authors
Publication date
1 January 2025
Publisher
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Doi

    Abstract

    Let f be a Boolean function given as either a truth table or a circuit. How difficult is it to find the decision tree complexity, also known as deterministic query complexity, of f in both cases? We prove that this problem is NC¹-hard and PSPACE-hard, respectively. The second bound is tight, and the first bound is close to being tight

    Similar works

    Full text

    thumbnail-image

    DROPS Dagstuhl Research Online Publication Server

    redirect
    oaioai:drops-oai.dagstuhl.de:2289...
    Last time updated on 07/03/2025

    This paper was published in DROPS Dagstuhl Research Online Publication Server.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.

    Licence: https://creativecommons.org/licenses/by/4.0/legalcode