We consider the #P-complete problem of counting the number of linear extensions of a poset (LE is fixed-parameter intractable parameterized by the treewidth of the cover graph. This resolves an open problem recently posed in the Dagstuhl seminar on Exact Algorithms. On the positive side we show thatPeer reviewe
Abstract We address the following natural but hitherto unstudied question: what are t...
Let P be a finite poset. By definition, the linear extension polytope of P has as vertices the chara...
We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete pos...
We consider the #P-complete problem of counting the number of linear extensions of a poset (LE is fi...
We consider the #P-complete problem of counting the number of linear extensions of a poset (LE is fi...
We consider the #P-complete problem of counting the number of linear extensions of a poset (#LE); a ...
We consider the #P-complete problem of counting the number of linear extensions of a poset (#LE); a ...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We consider the problem of counting the linear extensions of an n-element poset whose cover graph ha...
We consider the problem of counting the linear extensions of an n-element poset whose cover graph ha...
This dissertation investigates the difficulty of counting two classes of combinatorial objects, line...
Abstract. The number e(P) of linear extensions of a finite poset P is expressed in terms of e(Q) for...
Abstract We address the following natural but hitherto unstudied question: what are t...
Let P be a finite poset. By definition, the linear extension polytope of P has as vertices the chara...
We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete pos...
We consider the #P-complete problem of counting the number of linear extensions of a poset (LE is fi...
We consider the #P-complete problem of counting the number of linear extensions of a poset (LE is fi...
We consider the #P-complete problem of counting the number of linear extensions of a poset (#LE); a ...
We consider the #P-complete problem of counting the number of linear extensions of a poset (#LE); a ...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We investigate the problem of computing the number of linear extensions of a given n-element poset w...
We consider the problem of counting the linear extensions of an n-element poset whose cover graph ha...
We consider the problem of counting the linear extensions of an n-element poset whose cover graph ha...
This dissertation investigates the difficulty of counting two classes of combinatorial objects, line...
Abstract. The number e(P) of linear extensions of a finite poset P is expressed in terms of e(Q) for...
Abstract We address the following natural but hitherto unstudied question: what are t...
Let P be a finite poset. By definition, the linear extension polytope of P has as vertices the chara...
We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete pos...
DOI
Add to ORKG