1132 search results - page 142 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
204
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
167
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
168
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
171
click to vote
TIT
2008
15 years 6 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
172
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...