Sciweavers

1132 search results - page 15 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
TCS
2008
13 years 6 months ago
On the bandwidth of 3-dimensional Hamming graphs
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
J. Balogh, Sergei L. Bezrukov, L. H. Harper, &Aacu...
DM
2010
140views more  DM 2010»
13 years 6 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
ALT
2008
Springer
14 years 3 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
SPDP
1990
IEEE
13 years 10 months ago
Energy complexity of optical computations
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
Akhilesh Tyagi, John H. Reif
STOC
2010
ACM
174views Algorithms» more  STOC 2010»
14 years 4 months ago
Towards Polynomial Lower Bounds for Dynamic Problems
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic alg...
Mihai Patrascu