3897 search results - page 50 / 780 » complexity 2010 |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We determine set-theoretic defining equations for the variety Dualk,d,N P(Sd CN ) of hypersurfaces of degree d in CN that have dual variety of dimension at most k. We apply these ...
TCBB
2010
13 years 6 months ago
2010
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...