3208 search results - page 290 / 642 » A Lower Bound for Primality |
147
click to vote
LPAR
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
163
click to vote
TPHOL
2005
IEEE
16 years 8 days ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
198
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
139
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
175
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...