4850 search results - page 27 / 970 » Proof and Computation in Geometry |
ADG
1998
Springer
15 years 3 months ago
1998
Springer
This paper reviews and evaluates three main techniques for automated geometry diagram construction: synthetic methods, numerical computation methods, and symbolic computation metho...
81
Voted
FLOPS
2006
Springer
15 years 2 months ago
2006
Springer
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
102
click to vote
COMPGEOM
1996
ACM
15 years 3 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
STACS
1997
Springer
15 years 3 months ago
1997
Springer
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
CSL
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...