Sciweavers

13383 search results - page 206 / 2677
» Abstractions from proofs
Sort
View
JSC
2006
71views more  JSC 2006»
15 years 6 months ago
Towards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
Matthias Baaz, Alexander Leitsch
ECCC
2010
106views more  ECCC 2010»
15 years 5 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
JMIV
2008
118views more  JMIV 2008»
15 years 6 months ago
Recognising Algebraic Surfaces from Two Outlines
Photographic outlines of 3 dimensional solids are robust and rich in information useful for surface reconstruction. This paper studies algebraic surfaces viewed from 2 cameras with...
Simon Collings, Ryszard Kozera, Lyle Noakes
INFORMATICALT
2006
105views more  INFORMATICALT 2006»
15 years 6 months ago
Adaptive Chosen Ciphertext Secure Threshold Key Escrow Scheme from Pairing
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...
Yu Long, Kefei Chen, Shengli Liu
MCS
2007
Springer
15 years 6 months ago
Nonlinearity from linearity: The Ermakov-Pinney equation revisited
In this short note, we revisit the so-called Ermakov–Pinney (EP) equation viewing its properties from a physically motivated perspective. We discuss its ties with the Schr¨odin...
Panayotis G. Kevrekidis, Yannis Drossinos