11949 search results - page 84 / 2390 » Some results on (a:b)-choosability |
105
click to vote
KRDB
2001
15 years 2 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
100
Voted
DM
2006
15 years 25 days ago
2006
The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions ...
103
Voted
DAGSTUHL
2007
2007
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
15 years 2 months ago
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...
SIGACT
2010
14 years 11 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
147
Voted
LPNMR
2011
Springer
14 years 3 months ago
2011
Springer
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) sta...