Abstract Model complexity is a fundamental problem in deep learning. In this paper, we
conduct a systematic overview of the latest studies on model complexity in deep learning …

This book is about the verification of reactive systems. A reactive system is a system that
maintains an ongoing interaction with its environment, as opposed to computing some final …

We discuss several complexity measures for Boolean functions: certificate complexity,
sensitivity, block sensitivity, and the degree of a representing or approximating polynomial …

This paper present a new approach to finding minimum cuts in undirected graphs. The
fundamental principle is simple: the edges in a graph's minimum cut form an extremely small …

This paper presents a new algorithm for nding global min-cuts in weighted, undirected
graphs. One of the strengths of the algorithm is its extreme simplicity. This randomized …

Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …

We study how the notions of importance of variables in Boolean functions as well as the
sensitivities of the functions to changes in these variables impact the dynamical behavior of …

It was around the period of World War II that Arturo Rosenblueth and Norbert Wiener were
taking the first steps in the direction of systems medicine. They formed an interesting pair …

This paper gives a full characterization of the time needed to compute a Boolean function on
a CREW PRAM with an unlimited number of processors. The characterization is given in …

Abstract Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit
strings requires a time-space tradeoff of TS= f~(nm). The bound holds in the general …