bibliographer - Seinosuke Toda

bibliographer a curated TCS bibliography

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

Counting Problems Computationally Equivalent to Computing the Determinant Seinosuke Toda [github]

On Closure Properties of P in the Context of PF P Mitsunori Ogihara Thomas Thierauf Seinosuke Toda Osamu Watanabe [github]

PP is as Hard as the Polynomial-Time Hierarchy Seinosuke Toda [github]

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs Ryuhei Uehara Seinosuke Toda Takayuki Nagoya [github]

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

[show logs] [hide logs]