Edinah Gnang, Johns Hopkins University

Abstract

We describe how combinatorial enumeration and listing problem in connection with structural properties of hypermatrices determine critical aspect of the complexity of Boolean function. The talk will not assume familiarity with Boolean functions nor with hypermatrices.

Presented Via Zoom: https://rutgers.zoom.us/j/94346444480

Password: 6564120420