LIPIcs.STACS.2025.66.pdf
- Filesize: 0.67 MB
- 13 pages
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.
Feedback for Dagstuhl Publishing