190 search results - page 7 / 38 » A Simple Proof Technique for Certain Parametricity Results |
105
Voted
COMPGEOM
1995
ACM
15 years 2 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
91
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
205
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
100
Voted
TOG
2002
14 years 10 months ago
2002
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...