127 search results - page 18 / 26 » Computational Complexity of Some Problems Involving Congruen... |
SOFSEM
1999
Springer
13 years 11 months ago
1999
Springer
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
ERLANG
2003
ACM
14 years 23 days ago
2003
ACM
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
AADEBUG
1993
Springer
13 years 11 months ago
1993
Springer
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...