989 search results - page 82 / 198 » Pebbling and Proofs of Work |
ECCC
2006
13 years 8 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
JAR
2006
13 years 8 months ago
2006
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high inte...
ENTCS
2007
13 years 8 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
JMIV
2007
13 years 8 months ago
2007
We discuss the existence of viscosity solutions for a class of anisotropic level-set methods which can be seen as an extension of the mean-curvature motion with a nonlinear anisot...
JAR
2002
13 years 7 months ago
2002
Abstract. This paper reports on the Mizar formalization of the theory of continuous lattices as presented in A Compendium of Continuous Lattices, [25]. By the Mizar formalization w...