Search Sciweavers | Sciweavers

4940 search results - page 19 / 988

» On the Complexity of Universal Programs

109

click to vote

MP
2008

135views more MP 2008»

A path to the Arrow-Debreu competitive market equilibrium

15 years 3 months ago

Download www.stanford.edu

: 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

claim paper

Read More »

195

click to vote

POPL
2005
ACM

106views Programming Languages» more POPL 2005»

A bisimulation for type abstraction and recursion

16 years 3 months ago

Download www.kb.ecei.tohoku.ac.jp

traction and Recursion Eijiro Sumii Benjamin C. Pierce University of Pennsylvania

Eijiro Sumii, Benjamin C. Pierce

claim paper

Read More »

105

click to vote

POPL
2010
ACM

192views Programming Languages» more POPL 2010»

Type inference for datalog with complex type hierarchies

15 years 10 months ago

Download www.datalog20.com

Max Schäfer, Oege de Moor

claim paper

Read More »

click to vote

ICALP
2010
Springer

104views Programming Languages» more ICALP 2010»

Graph Homomorphisms with Complex Values: A Dichotomy Theorem

15 years 8 months ago

Download pages.cs.wisc.edu

Jin-yi Cai, Xi Chen, Pinyan Lu

claim paper

Read More »

click to vote

ICALP
2010
Springer

102views Programming Languages» more ICALP 2010»

Exponential Time Complexity of the Permanent and the Tutte Polynomial

15 years 8 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers