1132 search results - page 143 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
172
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
163
click to vote
CDC
2008
IEEE
16 years 27 days ago
2008
IEEE
— In this paper we obtain information theoretical conditions for tracking in linear time-invariant control systems. We consider the particular case where the closed loop contains...
153
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
141
click to vote
FOCM
2010
15 years 5 months ago
2010
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
149
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...