The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...