Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...