1193 search results - page 43 / 239 » A primer of simple theories |
147
click to vote
ENTCS
2002
15 years 6 months ago
2002
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
177
click to vote
RSA
2011
15 years 1 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
180
click to vote
EUROCAST
2005
Springer
16 years 9 days ago
2005
Springer
In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given an...
176
click to vote
AML
2006
15 years 6 months ago
2006
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
165
click to vote
IPL
2000
15 years 6 months ago
2000
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...