Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
Md. Altaf-Ul-Amin, Yoko Shinbo, Kenji Mihara, Ken ...
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
Relations On Abstract Simplicial Complexes Talk at CASC 2005, Kalamata, Greece Vladimir Kornyak Laboratory of Information Technologies Joint Institute for Nuclear Research 13 Septe...