787 search results - page 43 / 158 » Polynomial Constants are Decidable |
DAM
2011
13 years 2 months ago
2011
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
IJFCS
2008
13 years 8 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
ISM
2005
IEEE
14 years 1 months ago
2005
IEEE
In wireless communications, the available throughput depends on several parameters, like physical layer, base station distance, fading and interference. Users experience changes i...
AMAI
2008
Springer
13 years 8 months ago
2008
Springer
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...