133 search results - page 3 / 27 » On a Fully Abstract Model for a Quantum Linear Functional La... |
AISC
2008
Springer
13 years 7 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
TACS
1994
Springer
13 years 9 months ago
1994
Springer
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
SCP
1998
13 years 5 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Until recently, computational aspects of the Shapley value were only studied under the assumption that there are no externalities from coalition formation, i.e., that the...