bibliographer - Ryan Williams

bibliographer a curated TCS bibliography

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

A Theory for Probabilistic Polynomial-Time Reasoning Lijie Chen Jiatu Li Igor C. Oliveira Ryan Williams [github]

On the Number of Quantifiers as a Complexity Measure Ronald Fagin Jonathan Lenchner Nikhil Vyas Ryan Williams [github]

Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems Virginia Vassilevska Ryan Williams Raphael Yuster [github]

A new algorithm for optimal 2-constraint satisfaction and its implications Ryan Williams [github]

Tight Hardness for Shortest Cycles and Paths in Sparse Graphs Andrea Lincoln Virginia Vassilevska Williams Ryan Williams [github]

Finding heaviest H-subgraphs in real weighted graphs, with applications Virginia Vassilevska Ryan Williams Raphael Yuster [github]

Faster all-pairs shortest paths via circuit complexity Ryan Williams [github]

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

[show logs] [hide logs]