2588 search results - page 337 / 518 » Applications of Kolmogorov complexity to computable model th... |
170
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
169
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
194
click to vote
CRV
2005
IEEE
16 years 5 days ago
2005
IEEE
The problem of elucidating the functional significance of genes is a key challenge of modern science. Solving this problem can lead to fundamental advancements across multiple are...
183
click to vote
MEMOCODE
2006
IEEE
16 years 17 days ago
2006
IEEE
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
177
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...