5100 search results - page 187 / 1020 » The Linear Complexity of a Graph |
CRYPTO
2012
Springer
12 years 1 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
ENTCS
2006
13 years 10 months ago
2006
Extending the work of [7] on groups definable in compact complex manifolds and of [1] on strongly minimal groups definable in nonstandard compact complex manifolds, we classify al...
INFORMS
2010
13 years 8 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...