Sciweavers

3228 search results - page 457 / 646
» Computationally Sound Proofs
Sort
View
138
Voted
COMBINATORICS
1999
139views more  COMBINATORICS 1999»
15 years 3 months ago
A Closer Look at Lattice Points in Rational Simplices
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
Matthias Beck
109
Voted
JOC
2002
76views more  JOC 2002»
15 years 3 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
118
Voted
MOC
1998
147views more  MOC 1998»
15 years 3 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
116
Voted
RML
2002
82views Business» more  RML 2002»
15 years 3 months ago
A Nonmonotonic Rule System using Ontologies
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language whic...
Grigoris Antoniou
115
Voted
FOCM
2010
160views more  FOCM 2010»
15 years 2 months ago
Boundary Measures for Geometric Inference
We study the boundary measures of compact subsets of the d-dimensional Euclidean space, which are closely related to Federer’s curvature measures. We show that they can be comput...
Frédéric Chazal, David Cohen-Steiner...