| Budget Amount *help |
¥5,330,000 (Direct Cost: ¥4,100,000、Indirect Cost: ¥1,230,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2013: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2012: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
|
|---|
| Outline of Final Research Achievements |
On the representation of Boolean functions by polynomial threshold functions (PTF, in short), we showed that the property called XOR Lemma, which has shown to be true for PTF degree, is not hold if we consider other important measures such as PTF weight or length. We developed a method for reducing the problem of analyzing the non-deterministic communication complexity of Boolean functions to the one of constructing a decomposition of a certain graph, and gave an improved lower bound on the complexity of the clique versus independent set problem. In addition, we gave a new algorithm for satisfiability problem for a certain class of threshold circuits.
|
