4850 search results - page 690 / 970 » Proof and Computation in Geometry |
178
click to vote
CC
2008
Springer
15 years 6 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
167
click to vote
CJTCS
1999
15 years 6 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
345
click to vote
EUROPKI
2009
Springer
15 years 4 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
206
click to vote
ICTAC
2009
Springer
15 years 4 months ago
2009
Springer
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...
241
click to vote
NETWORKS
2011
14 years 9 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...