Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
Individual functional requirements represent fragments of behavior, while a design that satisfies a set of functional requirements represents integrated behavior. This perspective ...
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...