Counting Linear Extensions Below the 2^n Barrier
Statement
Koivisto asked at Dagstuhl in 2013 whether the linear extensions of an arbitrary -element poset can be counted exactly in time for some . Yes: a deterministic exact algorithm runs in , breaking the 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.