Sciweavers

9 search results - page 2 / 2
» The complexity of Tarski's fixed point theorem
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
A statistical mechanical interpretation of algorithmic information theory
Abstract. We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, s...
Kohtaro Tadaki
213
Voted
CIE
2007
Springer
15 years 10 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
FOCS
2008
IEEE
15 years 6 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
JC
2002
50views more  JC 2002»
15 years 6 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian