2479 search results - page 160 / 496 » Quantum complexity theory |
143
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
146
click to vote
HICSS
2007
IEEE
16 years 1 months ago
2007
IEEE
We examine learning culture in a popular online game, World of Warcraft. We analyze the way players learn this complex game through chat conversation with peers. We describe three...
160
click to vote
STACS
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...
172
click to vote
WSCG
2001
15 years 8 months ago
2001
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
188
click to vote
MST
2010
15 years 1 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...