4378 search results - page 92 / 876 » On the Complexity of Ordered Colourings |
JCT
2006
13 years 9 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
IANDC
2007
13 years 9 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
TSP
2008
13 years 9 months ago
2008
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
CORR
1998
Springer
13 years 8 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...