Sciweavers

96 search results - page 2 / 20
» Alpha-Beta Witness Complexes
Sort
View
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
13 years 11 months ago
Low-Depth Witnesses are Easy to Find
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
Luis Antunes 0002, Lance Fortnow, Alexandre Pinto,...
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
13 years 9 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
13 years 9 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
ATVA
2004
Springer
77views Hardware» more  ATVA 2004»
13 years 10 months ago
Localizing Errors in Counterexample with Iteratively Witness Searching
We propose a novel approach to locate errors in complex counterexample of safety property. Our approach measures the distance between two state transition traces with difference o...
ShengYu Shen, Ying Qin, Sikun Li

Book
1063views
11 years 11 months ago
Advanced Wireless LAN
The past two decades have witnessed starling advances in wireless LAN technologies that were stimulated by its increasing popularity in the home due to ease of installation, and in...