20 citations · 86 across the 16 of their papers we have counts for
3 papers · 1 filter
The Computational Complexity of Variational Inequalities and Applications in Game Theory
Bruce M. Kapron, Koosha Samieefar
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-co…
On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version)
Ugo Dal Lago, Davide Davoli, Bruce M. Kapron
Separation logic is a substructural logic which has proved to have numerous and fruitful applications to the verification of programs working on dynamic data structures. Recently,…
Declassification Policy for Program Complexity Analysis
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion +1
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complex…