29908 search results - page 252 / 5982 » On the complexity of communication complexity |
178
click to vote
EJC
2010
15 years 6 months ago
2010
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...
196
click to vote
BMCBI
2006
15 years 6 months ago
2006
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...
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
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)
143
Voted
PCS
2006
15 years 6 months ago
2006
Relations On Abstract Simplicial Complexes Talk at CASC 2005, Kalamata, Greece Vladimir Kornyak Laboratory of Information Technologies Joint Institute for Nuclear Research 13 Septe...
165
click to vote
IJAR
2007
15 years 6 months ago
2007
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...