4378 search results - page 99 / 876 » On the Complexity of Ordered Colourings |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
JAPLL
2006
13 years 9 months ago
2006
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
VTC
2008
IEEE
14 years 3 months ago
2008
IEEE
—In this paper, we consider the problem of precoding in large multiuser MISO systems, where by ‘large’ we mean i) large number of transmit antennas (Nt) at the base station o...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
COMPLEXITY
2010
13 years 6 months ago
2010
To gain a deeper understanding of the impact of spatial embedding on the dynamics of complex systems we employ a measure of interaction complexity developed within neuroscience us...