5608 search results - page 156 / 1122 » On the Theory of Matchgate Computations |
112
click to vote
LICS
1991
IEEE
15 years 5 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
SIGDOC
2006
ACM
15 years 7 months ago
2006
ACM
The ethical conduct of research is a cornerstone of modern scientific research. Computer science and the discipline’s technological artifacts touch nearly every aspect of moder...
CIE
2005
Springer
15 years 7 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
112
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
153
click to vote
HASKELL
2009
ACM
15 years 8 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...