New for: D3
This is the second meeting of the now (allegedly)
regular weekly seminar devoted to open problems in
computer science of broad interest.
The last week's open problem raised by Tom Henzinger
"Whether Buchi tree automata nonemptiness is solvable
in deterministic subquadratic (preferably linear) time?"
still remains unsolved.