bibliographer - Michael Sipser

bibliographer a curated TCS bibliography

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

Halting space-bounded computations Michael Sipser [github]

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

Parity, circuits, and the polynomial-time hierarchy Merrick Furst James B. Saxe Michael Sipser [github]

A topological view of some problems in complexity theory Michael Sipser [github]

Borel sets and circuit complexity Michael Sipser [github]

Nondeterminism and the size of two way finite automata William J. Sakoda Michael Sipser [github]

Library Size: 13G (6 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A

[show logs] [hide logs]