1055 search results - page 2 / 211 » Enumerations in computable structure theory |
SOFSEM
2000
Springer
13 years 9 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
STACS
2009
Springer
14 years 16 days ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
ICPP
2009
IEEE
14 years 12 days ago
2009
IEEE
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
MCU
2004
13 years 7 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...