3228 search results - page 350 / 646 » Computationally Sound Proofs |
148
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
116
click to vote
DLT
2006
15 years 5 months ago
2006
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
129
click to vote
ADCM
2007
15 years 4 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical diļ¬erentiation. Under an a priori and an a posteriori choice r...
138
click to vote
TCS
2008
15 years 4 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
124
click to vote
ECCC
2002
15 years 3 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...