research
∙
05/08/2023
The Computational Complexity of Equilibria with Strategic Constraints
Computational aspects of solution notions such as Nash equilibrium have ...
share
research
∙
08/31/2022
Complete and tractable machine-independent characterizations of second-order polytime
The class of Basic Feasible Functionals BFF is the second-order counterp...
research
∙
02/23/2021
A tier-based typed programming language characterizing Feasible Functionals
The class of Basic Feasible Functionals BFF_2 is the type-2 counterpart ...
research
∙
10/12/2020
MMH* with arbitrary modulus is always almost-universal
Universal hash functions, discovered by Carter and Wegman in 1979, are o...
research
∙
10/12/2020
Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes
In this paper, we first give explicit formulas for the number of solutio...
research
∙
10/12/2020
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs
Let _n[i] be the ring of Gaussian integers modulo a positive integer n. ...
research
∙
08/14/2019
Type-two Iteration with Bounded Query Revision
Motivated by recent results of Kapron and Steinberg (LICS 2018) we intro...
research
∙
01/23/2018
Type-two polynomial-time and restricted lookahead
This paper provides an alternate characterization of type-two polynomial...
research
∙
12/19/2017
