Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
— Robots that can interact naturally with humans require the integration and coordination of many different components with heavy computational demands. We argue that an architec...
Mobile code solutions can improve the performances of applications over the Internet by reducing the amount of data that must be transferred across the network. The research on ge...