Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Kapron, Bruce M."'
Autor:
Pudlák, Pavel
Publikováno v:
The Bulletin of Symbolic Logic, 2023 Dec 01. 29(4), 657-660.
Externí odkaz:
https://www.jstor.org/stable/27285437
Autor:
Kapron, Bruce M., Samieefar, Koosha
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game theory, we sp
Externí odkaz:
http://arxiv.org/abs/2411.04392
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, Barthe, Hsu and Liao have proposed a new way of giving semantics to se
Externí odkaz:
http://arxiv.org/abs/2405.11987
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in polynomial ti
Externí odkaz:
http://arxiv.org/abs/2401.14957
Autor:
Kapron, Bruce M., Samieefar, Koosha
Computational aspects of solution notions such as Nash equilibrium have been extensively studied, including settings where the ultimate goal is to find an equilibrium that possesses some additional properties. Furthermore, in order to address issues
Externí odkaz:
http://arxiv.org/abs/2305.04918
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of terms. Thes
Externí odkaz:
http://arxiv.org/abs/2208.14739
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 24, 2022) lmcs:7216
The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming lang
Externí odkaz:
http://arxiv.org/abs/2102.11605
Publikováno v:
Information Processing Letters 116 (2016), 481-483
Universal hash functions, discovered by Carter and Wegman in 1979, are of great importance in computer science with many applications. MMH$^*$ is a well-known $\triangle$-universal hash function family, based on the evaluation of a dot product modulo
Externí odkaz:
http://arxiv.org/abs/2010.05420
Publikováno v:
Designs, Codes and Cryptography 86 (2018), 1893-1904
In this paper, we first give explicit formulas for the number of solutions of unweighted linear congruences with distinct coordinates. Our main tools are properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions. Then
Externí odkaz:
http://arxiv.org/abs/2010.05415