bibliographer - Jacobo Torán

bibliographer a curated TCS bibliography

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

The Complexity of Algorithmic Problems on Succinct Instances José L. Balcázar Antoni Lozano Jacobo Torán [github]

The Complexity of Planar Graph Isomorphism Jacobo Torán Fabian Wagner [github]

The Complexity of Planar Graph Isomorphism Jacobo Torán Fabian Wagner [github]

Graph isomorphism is low for PP Johannes Köbler Uwe Schöning Jacobo Torán [github]

On the Hardness of Graph Isomorphism Jacobo Torán [github]

Complexity classes defined by counting quantifiers Jacobo Torán [github]

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

[show logs] [hide logs]