2661 search results - page 147 / 533 » Quantum Complexity Classes |
109
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
112
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
154
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
140
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
156
click to vote
CCR
2006
15 years 3 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...