Sciweavers

72 search results - page 7 / 15
» On a syntactic approximation to logics that capture complexi...
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 5 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
BSL
2006
114views more  BSL 2006»
13 years 7 months ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini
JISBD
2001
13 years 8 months ago
Migration of Legacy Systems to the Web
Migration of Legacy Systems to the Web is one of the main concerns of enterprises looking for more flexible distributed application environments. This migration process comprises t...
Cristina Cachero, Jaime Gómez, Antonio P&aa...
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
13 years 7 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin