Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
The Macaulay2 package PHCpack.m2 provides an interface to some of the functionality of PHCpack, a general-purpose solver for polynomial systems by homotopy continuation. The main f...
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...