類似資料

• Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions
  著者:: Geniet, Colin, 等
  出版事項: (2026)
• Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs
  著者:: Goubault-Larrecq, Aliénor, 等
  出版事項: (2025)
• Complexity of Boolean automata networks under block-parallel update modes
  著者:: Perrot, Kévin, 等
  出版事項: (2024)
• Hardness of monadic second-order formulae over succinct graphs
  著者:: Gamard, Guilhem, 等
  出版事項: (2023)
• The Unit Gap: How Sharing Works in Boolean Circuits
  著者:: Krinkin, Kirill
  出版事項: (2026)