Sciweavers

4850 search results - page 73 / 970
» Proof and Computation in Geometry
Sort
View
CSR
2006
Springer
15 years 10 months ago
Logic of Proofs for Bounded Arithmetic
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
Evan Goris
MSCS
2007
125views more  MSCS 2007»
15 years 5 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym
COMPGEOM
2007
ACM
15 years 10 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
CORR
2010
Springer
59views Education» more  CORR 2010»
15 years 6 months ago
Improved analysis of the subsampled randomized Hadamard transform
This paper presents an improved analysis of a structured dimension-reduction map called the subsampled randomized Hadamard transform. This argument demonstrates that the map preser...
Joel A. Tropp