Sciweavers

77 search results - page 6 / 16
» A note on single-linkage equivalence
Sort
View
TIT
2011
111views more  TIT 2011»
14 years 4 months ago
Counting Partial Spread Functions in Eight Variables
Abstract. In this note we report the following computational results on partial spread functions in 8 variables: (i) the numbers of equivalence classes of partial spread functions ...
Philippe Langevin, Xiang-dong Hou
CSR
2009
Springer
15 years 4 months ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
15 years 3 months ago
Some Basics on Tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
Boris Goldengorin, Gerold Jäger, Paul Molitor
PKC
2005
Springer
94views Cryptology» more  PKC 2005»
15 years 2 months ago
The Security of the FDH Variant of Chaum's Undeniable Signature Scheme
In this paper, we first introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply im...
Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
15 years 2 months ago
A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
Atefeh Mashatan, Serge Vaudenay