bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

  • The complexity of two problems on arithmetic circuits Pascal Koiran Sylvain Perifel Tue 18 October 2022
  • Descriptive complexity of P functions: A new perspective Arnaud Durand Anselm Haak Juha Kontinen Heribert Vollmer Fri 01 July 2022
  • Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth Arnaud Durand Anselm Haak Heribert Vollmer Fri 01 July 2022

Library Size: 13G (3 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge
[show logs] [hide logs]