1007 search results - page 101 / 202 » The Complexity of Futile Questioning |
105
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
113
click to vote
IJCAI
2003
15 years 2 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
98
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
103
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
103
Voted
IJCAI
2003
15 years 2 months ago
2003
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...