Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
A tool which can quickly interpret line drawings (with hidden lines removed) of engineering objects as boundary representation CAD models would be of significant benefit in the pr...