Zobrazeno 1 - 10
of 780
pro vyhledávání: '"Kapron A"'
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:
Li Jiang, Wang Kaili, Starodubtseva Maria N., Nadyrov Eldar, Kapron Carolyn M., Hoh Josephine, Liu Ju
Publikováno v:
Medical Review, Vol 4, Iss 5, Pp 452-466 (2024)
Angiogenesis, the process of formation of new capillaries from existing blood vessels, is required for multiple physiological and pathological processes. Complement factor H (CFH) is a plasma protein that inhibits the alternative pathway of the compl
Externí odkaz:
https://doaj.org/article/1c818e215a4a453b954e67de3360aa09
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
Autor:
Trinh, Linh, Bienkowski, Krzysztof, Parzuch, Aleksandra, Wróbel, Piotr, Kaproń, Grzegorz, Pisarek, Marcin, Solarska, Renata
Publikováno v:
In International Journal of Hydrogen Energy 18 October 2024 87:1171-1179
Autor:
Radtke, Logan E., Blackburn, Brenna E., Kapron, Claire R., Erickson, Jill A., Meier, Adam W., Anderson, Lucas A., Gililland, Jeremy M., Archibeck, Michael J., Pelt, Christopher E.
Publikováno v:
In The Journal of Arthroplasty September 2024 39(9) Supplement 2:S134-S142
Autor:
Kapron-King, Anna, Xu, Yang
The use of euphemisms is a known driver of language change. It has been proposed that women use euphemisms more than men. Although there have been several studies investigating gender differences in language, the claim about euphemism usage has not b
Externí odkaz:
http://arxiv.org/abs/2106.02083
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