2446 search results - page 263 / 490 » Choiceless Polynomial Time |
116
Voted
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
121
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
148
Voted
ESWS
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
132
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
136
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...