bibliographer - David Lichtenstein

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Computing a perfect strategy for n n chess requires time exponential in n Aviezri S Fraenkel David Lichtenstein [github]

GO Is Polynomial-Space Hard David Lichtenstein Michael Sipser [github]

Library Size: 13G (2 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]