4315 search results - page 100 / 863 » Sorting in linear time |
169
click to vote
CG
2006
Springer
15 years 11 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
192
click to vote
FSTTCS
2003
Springer
16 years 12 days ago
2003
Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
193
click to vote
CDC
2009
IEEE
15 years 12 months ago
2009
IEEE
Abstract— In this paper, dynamic practical stability properties of infinite-dimensional sampled-data systems are discussed. A family of finite-dimensional discrete-time control...
161
click to vote
CSL
2008
Springer
15 years 9 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
163
click to vote
JDA
2006
15 years 7 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...