2661 search results - page 353 / 533 » Quantum Complexity Classes |
209
click to vote
RE
2010
Springer
15 years 1 months ago
2010
Springer
Trace links between requirements and code are essential for many software development and maintenance activities. Despite significant advances in traceability research, creating li...
160
click to vote
DSD
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
174
click to vote
ATAL
2009
Springer
16 years 28 days ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
182
click to vote
ICALP
2007
Springer
16 years 15 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
175
click to vote
ICN
2005
Springer
15 years 11 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...