3690 search results - page 239 / 738 » Computation with classical sequents |
92
Voted
APPML
2005
15 years 21 days ago
2005
Three iterative refinement schemes are studied for approximating the solutions of linear weakly singular Fredholm integral equations of the second kind. The rates of convergence a...
114
click to vote
TCS
2008
15 years 21 days ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
126
click to vote
JSC
2007
15 years 20 days ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
84
Voted
COMBINATORICS
2000
15 years 18 days ago
2000
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
114
Voted
TCS
2002
15 years 13 days ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...