Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Wood, Kenan"'
Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of a graph is the least integer such tha
Externí odkaz:
http://arxiv.org/abs/2411.19314
Preference aggregation is a fundamental problem in voting theory, in which public input rankings of a set of alternatives (called preferences) must be aggregated into a single preference that satisfies certain soundness properties. The celebrated Arr
Externí odkaz:
http://arxiv.org/abs/2409.04685
We present the notion of multilevel slashing, where proof-of-stake blockchain validators can obtain gradual levels of assurance that a certain block is bound to be finalized in a global consensus procedure, unless an increasing and optimally large nu
Externí odkaz:
http://arxiv.org/abs/2405.08135
An automated market maker (AMM) is a state machine that manages pools of assets, allowing parties to buy and sell those assets according to a fixed mathematical formula. AMMs are typically implemented as smart contracts on blockchains, and its prices
Externí odkaz:
http://arxiv.org/abs/2401.04289
Correctness of results from mixed-integer linear programming (MILP) solvers is critical, particularly in the context of applications such as hardware verification, compiler optimization, or machine-assisted theorem proving. To this end, VIPR 1.0 is t
Externí odkaz:
http://arxiv.org/abs/2312.10420
Autor:
Pulaj, Jonad, Wood, Kenan
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets $\mathcal{F}$ containing some nonempty set, there is some element $i$ in the ground set $U(\mathcal F) := \bigcup_{S \in \mathcal{F}} S$ of $\mathcal{F}
Externí odkaz:
http://arxiv.org/abs/2301.01331
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.