4372 search results - page 159 / 875 » Algorithmic Theories of Everything |
MST
2010
13 years 4 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
ECCC
2011
13 years 1 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
SIGECOM
2005
ACM
14 years 3 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
ISSAC
2005
Springer
14 years 3 months ago
2005
Springer
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...