2479 search results - page 202 / 496 » Quantum complexity theory |
178
click to vote
JASIS
2000
15 years 6 months ago
2000
: This article examines information theory from the aspect of its "conduit metaphor." A historical approach and a close reading of certain texts by Warren Weaver and Nor...
199
click to vote
CACM
1998
15 years 6 months ago
1998
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
185
click to vote
FCT
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
157
click to vote
APIN
2002
15 years 6 months ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
217
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...