bibliographer - Russell Impagliazzo

bibliographer a curated TCS bibliography

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

High Rate Efficient Local List Decoding from HDX Yotam Dikstein Max Hopkins Russell Impagliazzo Toniann Pitassi [github]

The Computational Complexity of Factored Graphs Shreya Gupta Boyang Huang Russell Impagliazzo Stanley Woo Christopher Ye [github]

Which Problems Have Strongly Exponential Complexity Russell Impagliazzo Ramamohan Paturi Francis Zane [github]

Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds Valentine Kabanets Russell Impagliazzo [github]

Near Optimal Separation Of Tree-Like And General Resolution Eli Ben-Sasson Russell Impagliazzo Avi Wigderson [github]

Exponential lower bounds for the pigeonhole principle Toniann Pitassi Paul Beame Russell Impagliazzo [github]

On the Complexity of k-SAT Russell Impagliazzo Ramamohan Paturi [github]

Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds Valentine Kabanets Russell Impagliazzo [github]

The relative complexity of NP search problems Paul Beame Stephen Cook Jeff Edmonds Russell Impagliazzo Toniann Pitassi [github]

Using the Groebner basis algorithm to find proofs of unsatisfiability Matthew Clegg Jeffery Edmonds Russell Impagliazzo [github]

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

[show logs] [hide logs]