62 search results - page 7 / 13 » Toida's Conjecture is True |
104
click to vote
SETA
2010
Springer
14 years 7 months ago
2010
Springer
It is a difficult challenge to find Boolean functions used in stream ciphers achieving all of the necessary criteria and the research of such functions has taken a significant d...
ISNN
2005
Springer
15 years 3 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
100
click to vote
JCO
2007
14 years 9 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
LICS
1995
IEEE
15 years 1 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
CCCG
2009
14 years 10 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...