COCO
1998
Springer
13 years 9 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
WIMOB
2007
IEEE
13 years 11 months ago
2007
IEEE
— There exists a multitude of location-sensing systems utilizing wireless technology, though varying in cost, coverage and accuracy. In this paper we will introduce WLocator, a s...