62 search results - page 10 / 13 » Zero-Knowledge Sets with Short Proofs |
BMCBI
2010
14 years 11 months ago
2010
Background: Microevolution is the study of short-term changes of alleles within a population and their effects on the phenotype of organisms. The result of the below-species-level...
SADFE
2008
IEEE
15 years 5 months ago
2008
IEEE
Secure logs are powerful tools for building systems that must resist forgery, prove temporal relationships, and stand up to forensic scrutiny. The proofs of order and integrity en...
STOC
2009
ACM
15 years 6 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
123
click to vote
NETWORKS
2011
14 years 2 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...
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...