bibliographer - Marek Karpinski

bibliographer a curated TCS bibliography

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

Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks Marek Karpinski Angus Macintyre [github]

On the computational complexity of quantified Horn clauses Marek Karpinski Hans Kleine Büning Peter H. Schmitt [github]

The matching problem for bipartite graphs with polynomially bounded permanents is in NC Dima Yu. Grigoriev Marek Karpinski [github]

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields Dima Yu. Grigoriev Marek Karpinski Michael F. Singer [github]

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

[show logs] [hide logs]