5608 search results - page 51 / 1122 » On the Theory of Matchgate Computations |
FOCM
2011
2011
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
14 years 8 months ago
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
108
click to vote
ENTCS
2008
15 years 1 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
141
click to vote
MST
2011
14 years 8 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
134
click to vote
FROCOS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
111
click to vote
APAL
1998
15 years 1 months ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...