Abstract. Software models are key in separating and solving independent development concerns. However, there is still a gap on how to transition design information among these sepa...
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Two international scientific publishers collaborated to develop an Online Submission and Peer Review System (OSPREY) for their journals. Our goals were to meet market demand, incr...
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...