Sciweavers

3 search results - page 1 / 1
» Two Short Proofs Concerning Tree-Decompositions
Sort
View
CPC
2002
64views more  CPC 2002»
13 years 5 months ago
Two Short Proofs Concerning Tree-Decompositions
Patrick Bellenbaum, Reinhard Diestel
FOCS
1999
IEEE
13 years 9 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
IACR
2011
158views more  IACR 2011»
12 years 4 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...