Sciweavers

224 search results - page 21 / 45
» A parallel repetition theorem
Sort
View
SAT
2007
Springer
96views Hardware» more  SAT 2007»
14 years 1 months ago
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
Marijn Heule, Hans van Maaren
CADE
2011
Springer
12 years 7 months ago
Extending Sledgehammer with SMT Solvers
Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically s...
Jasmin Christian Blanchette, Sascha Böhme, La...
CRYPTO
2009
Springer
144views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
On the Composition of Public-Coin Zero-Knowledge Protocols
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikstr...
ASAP
2006
IEEE
97views Hardware» more  ASAP 2006»
14 years 1 months ago
Dynamic-SIMD for lens distortion compensation
An increasing computational demand is placed on the image processing capacity of current and future smart cameras. SIMD processor architectures provide an efficient solution becau...
Bart Mesman, Hamed Fatemi, Henk Corporaal, Twan Ba...
POLICY
2001
Springer
14 years 3 days ago
Taxonomy and Description of Policy Combination Methods
To control complicated and decomposable networking functions, such as Diffserv, two or more policies must cooperate. Combining two or more mutually dependent policies for a specifi...
Yasusi Kanada