Lower bounds of the negation-limited circuit complexity

スポンサーリンク

概要

• 論文の詳細を見る

著者

• Sung Shao-chin

  School Of Information Science Japan Advanced Institute Of Science And Technology

• Tanaka Keisuke

  School Of Information Science Japan Advanced Institute Of Science And Technology

関連論文

• On the Negation-Limited Circuit Complexity of Clique Functions
• Single Machine Scheduling to Minimize the Maximum Lateness with Both Specific and Generalized Due Dates (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
• Approximation algorithms for scheduling problems with generalized due dates
• Negation-limited circuit complexity of symmetric functions
• Lower bounds of the negation-limited circuit complexity
• The Complexity of Threshold Circuits for Parity Functions
• A Relationship between the Number of Negations and the Circuit Size

スポンサーリンク