首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Bounded-depth Frege complexity of Tseitin formulas for all graphs
Institution:1. Dipartimento Ingegneria Informatica Automatica e Gestionale “A. Ruberti”, Sapienza Università di Roma, Italy;2. St. Petersburg Department of V.A. Steklov Institute of Mathematics of the Russian Academy of Sciences, Russian Federation;3. St. Petersburg State University, Russian Federation
Abstract:
Keywords:Proof complexity  Bounded-depth Frege  Resolution  Tseitin formulas  Treewidth
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号