Lifting to Parity Decision Trees Via Stifling

We show that the deterministic decision tree complexity of a (partial) function or relation \(f\) lifts to the deterministic parity decision tree (PDT) size complexity of the composed function/relation \(f \circ g\) as long as the gadget \(g\) satisfies a property that we call stifling. We observe t...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Chattopadhyay, Arkadev, Mande, Nikhil S, Sanyal, Swagato, Sherif, Suhail
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 30.11.2022
Subjects:	Complexity Decision trees Hoisting Lower bounds Parity Theorems
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!