2479 search results - page 213 / 496 » Quantum complexity theory |
186
click to vote
CONCUR
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
185
Voted
FUN
2010
Springer
15 years 11 months ago
2010
Springer
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
165
click to vote
INDOCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
146
click to vote
COCO
1998
Springer
15 years 11 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
160
click to vote
ICTAI
1994
IEEE
15 years 11 months ago
1994
IEEE
Combining various knowledge types - and reasoning methods - in knowledge-based systems is a challenge to the knowledge representation task. The paper describes an object-oriented,...