2661 search results - page 127 / 533 » Quantum Complexity Classes |
116
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
157
click to vote
SIGMOD
2000
ACM
15 years 7 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
104
click to vote
STACS
2000
Springer
15 years 6 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
120
click to vote
AAAI
2006
15 years 4 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
106
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...