Sciweavers

6978 search results - page 162 / 1396
» On Proofs in System P
Sort
View
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 18 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
CRYPTO
2012
Springer
215views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
We develop a new methodology for utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full sec...
Allison B. Lewko, Brent Waters
ROOM
2000
15 years 7 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark
CSL
2007
Springer
16 years 20 days ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
FOCS
1994
IEEE
15 years 10 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle