View source for Complexity Zoo talk:L

[[User:Johank|Johank]] ([[User talk:Johank|talk]]) 04:27, 30 January 2013 (EST) I was wondering whether to include an entry for {\cal L}P, the listing analog of #P. I encountered it in this  
[http://static.digns.com/uploads/doctoral_school/documents/phd-thesis/XVIII/rospocher_marco.pdf PhD thesis] but found no further reference in the literature. Actually, I was looking for a complexity class describing the complexity of listing all satisfying truth assignments to a 3SAT formula, and this was the only relevant reference I could find.

Is this a worthwhile addition? I'm a bit suspicious given that I found no further reference to these results in the literature...

best
Johan