Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...