Seiichi Tani

Learn More
Hass, Lagarias, and Pippenger analyzed the computational complexity of various decision problems in knot theory. They proved that the problem whether a given knot is unknotting is in <b>NP</b>, and conjectured that the problem is contained in <b>NP</b>&cap;co-<b>NP.</b> Agol, Hass, and Thurston proved that the problem called <i>ManifoldGenus</i>, which is a(More)
Large-degree nodes may have a larger influence on the network, but they can be bottlenecks for spreading information since spreading attempts tend to concentrate on these nodes and become redundant. We discuss that the reverse preferential spread (distributing information inversely proportional to the degree of the receiving node) has an advantage over(More)
In historical science and social science, the influence of natural disaster upon society is a matter of great interest. In recent years, some archives are made through many hands for natural disasters, however it is inefficiency and waste. So, we suppose a computer system to create a historical natural disaster archive. As the target of this analysis, we(More)
  • 1