Sciweavers

1763 search results - page 126 / 353
» A Formalization of Polytime Functions
Sort
View
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
14 years 10 months ago
Directed Animals and Gas Models Revisited
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
GIS
2002
ACM
14 years 9 months ago
Towards an evaluation of quality for names placement methods
The cartographic labeling problem is the problem of placing text on a map. This includes the positioning of the labels, and determining the shape in the case of line and area feat...
Steven van Dijk, Marc J. van Kreveld, Tycho Strijk...
JSYML
2002
92views more  JSYML 2002»
14 years 9 months ago
Groundwork for Weak Analysis
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
António M. Fernandes, Fernando Ferreira
TPHOL
2005
IEEE
15 years 3 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
ENTCS
2006
176views more  ENTCS 2006»
14 years 10 months ago
Gauss: A Framework for Verifying Scientific Computing Software
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
Robert Palmer, Steve Barrus, Yu Yang, Ganesh Gopal...