ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Koivisto asked at Dagstuhl in 2013 whether the linear extensions of an arbitrary nn-element poset can be counted exactly in time O∗(cn)O^*(c^n) for some c<2c < 2. Yes: a deterministic exact algorithm runs in O∗(1.89n)O^*(1.89^n), breaking the 2n2^n barrier for the general problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.