5608 search results - page 23 / 1122 » On the Theory of Matchgate Computations |
120
click to vote
FOSSACS
2011
Springer
14 years 4 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
140
click to vote
JAIR
2012
13 years 3 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
LLC
2011
14 years 8 months ago
2011
Computational phonology studies sound patterns in the world’s languages from a computational perspective. This article shows that the similarities between different generative t...
134
click to vote
CORR
2000
Springer
15 years 1 months ago
2000
Springer
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
117
click to vote
PRL
1998
15 years 1 months ago
1998
We present a computational, group-theoretic approach to steerable functions. The approach is group-theoretic in that the treatment involves continuous transformation groups for wh...