Maseeh Summer Undergraduate Research Experience

Funding Source

Undergraduate Research and Mentoring Program (URMP)

Document Type

Poster

Publication Date

2025

Abstract

This work looks at binary functions, exact degree, hypercube adjacency matrices, and sensitivity matrices. It seeks to answer the questions Can spectral sensitivity help lower bound the communication complexity of functions like it does in query complexity? What does a function’s sensitivity reveal about the communication needed between two people computing it together?

Persistent Identifier

https://archives.pdx.edu/ds/psu/45284

Download

Share

COinS