2412 search results - page 71 / 483 » Which Problems Have Strongly Exponential Complexity |
94
Voted
AAAI
2000
15 years 2 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
106
Voted
ECCC
2008
15 years 20 days ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
116
click to vote
FCT
1991
Springer
15 years 4 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
94
Voted
AI
2004
Springer
15 years 15 days ago
2004
Springer
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
100
Voted
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...