|
| Kenya UENO
|
Candidate Boolean Functions towards Super-Quadratic Formula Size
Kenya UENO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D
No. 3
pp. 524-531
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category:
Keyword:
Boolean function, computational complexity, formula complexity, | | | Summary | Full Text:PDF | |
|
Relating L versus P to Reversal versus Access and Their Combinatorial Structures
Kenya UENO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/12/01
Vol. E91-D
No. 12
pp. 2776-2783
Type of Manuscript:
PAPER
Category: Complexity Theory
Keyword:
complexity classes, random combinatorial structures, | | | Summary | Full Text:PDF | |
| |
|
|
|