1383 search results - page 84 / 277 » On the Complexity of the Interlace Polynomial |
154
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
136
click to vote
ACSD
2006
IEEE
16 years 11 days ago
2006
IEEE
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
144
click to vote
RSFDGRC
2005
Springer
15 years 11 months ago
2005
Springer
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
139
click to vote
WABI
2005
Springer
15 years 11 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
147
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...