1948 search results - page 186 / 390 » Formalizing Mirror Theory |
217
click to vote
MST
2011
15 years 1 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
167
click to vote
JUCS
2010
15 years 1 months ago
2010
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
261
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
164
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...