May 28, 2012 · Our main result is that intersection patterns of good covers are algorithmically unrecognizable. More precisely, the intersection pattern of a ...
Our main result is that intersection patterns of good covers are algorithmically unrecognizable. More precisely, the intersection pattern of a good cover can be ...
patterns of good covers are algorithmically unrecognizable. More precisely, the intersection pattern of a good cover can be stored in a simplicial complex ...
NERVES OF GOOD COVERS ARE ALGORITHMICALLY UNRECOGNIZABLE · A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any ...
May 28, 2012 · Our main result is that intersection patterns of good covers are algorithmically unrecognizable. ... nerve of a good cover in R^d. We prove that ...
... good covers were studied intensively. Our main result is that intersection patterns of good covers are algorithmically unrecognizable. More precisely, the ...
In 1975 Wegner conjectured that the nerve of every finite good cover in ℝd is d-collapsible, but this conjecture is disproved. In 1975 Wegner conjectured ...
We present new and improved fixed-parameter algorithms for computing maximum agreement forests of pairs of rooted binary phylogenetic trees.
3. Nerves of good covers are algorithmically unrecognizable (with Martin Tancer), SIAM J. Comput. 42(4) 1697-1719 (2013) ...
Nerves of good covers are algorithmically unrecognizable. M Tancer, D Tonkonog. SIAM Journal on Computing 42 (4), 1697-1719, 2013. 8, 2013. A simple proof of ...