2479 search results - page 172 / 496 » Quantum complexity theory |
179
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
162
click to vote
SIGACT
2010
15 years 5 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
204
click to vote
AGI
2011
14 years 10 months ago
2011
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
213
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
164
click to vote
ACL
1998
15 years 8 months ago
1998
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...