2430 search results - page 145 / 486 » Computing Tutte Polynomials |
155
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
126
click to vote
TCS
1998
15 years 4 months ago
1998
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
120
click to vote
ITNG
2007
IEEE
15 years 11 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
149
click to vote
WINE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
143
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...