Sciweavers

4940 search results - page 19 / 988
» On the Complexity of Universal Programs
Sort
View
95
Voted
MP
2008
135views more  MP 2008»
15 years 1 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
179
Voted
POPL
2005
ACM
16 years 2 months ago
A bisimulation for type abstraction and recursion
traction and Recursion Eijiro Sumii Benjamin C. Pierce University of Pennsylvania
Eijiro Sumii, Benjamin C. Pierce
94
Voted
POPL
2010
ACM
15 years 8 months ago
Type inference for datalog with complex type hierarchies
Max Schäfer, Oege de Moor
69
Voted
ICALP
2010
Springer
15 years 6 months ago
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
Jin-yi Cai, Xi Chen, Pinyan Lu
70
Voted
ICALP
2010
Springer
15 years 6 months ago
Exponential Time Complexity of the Permanent and the Tutte Polynomial
Holger Dell, Thore Husfeldt, Martin Wahlen