|
| Keyword : computational complexity
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
A Computationally Efficient Leaky and Regularized RLS Filter for Its Short Length
Eisuke HORITA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2017/12/01
Vol. E100-A
No. 12 ;
pp. 3045-3048
Type of Manuscript:
LETTER
Category: Digital Signal Processing
Keyword:
adaptive filter, RLS, computational complexity, regularization, Tikhonov, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
|
Computational Complexity of Generalized Golf Solitaire
Chuzo IWAMOTO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D
No. 3 ;
pp. 541-544
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category:
Keyword:
computational complexity, NP-completeness, puzzle, | | | Summary | Full Text:PDF | |
|
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 | |
| |
|
#P-hardness of Computing High Order Derivative and Its Logarithm
Ei ANDO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/06/01
Vol. E97-A
No. 6 ;
pp. 1382-1384
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
computable analysis, computational complexity, #P-hardness, SUBSET SUM, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
|
Verifying Structurally Weakly Persistent Net Is Co-NP Complete
Atsushi OHTA Kohkichi TSUJI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2011/12/01
Vol. E94-A
No. 12 ;
pp. 2832-2835
Type of Manuscript:
Special Section LETTER (Special Section on Mathematical Systems Science and its Applications)
Category:
Keyword:
concurrent system, Petri net, subclass, computational complexity, | | | Summary | Full Text:PDF | |
| |
| |
|
Computational Complexity of Liveness Problem of Normal Petri Net
Atsushi OHTA Kohkichi TSUJI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/11/01
Vol. E92-A
No. 11 ;
pp. 2717-2722
Type of Manuscript:
Special Section PAPER (Special Section on Theory of Concurrent Systems and its Applications)
Category:
Keyword:
concurrent system, Petri net, liveness, computational complexity, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Strong Identification Based on a Hard-on-Average Problem
Pino CABALLERO-GIL | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A
No. 5 ;
pp. 1117-1121
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
cryptography, computational complexity, algorithms, discrete mathematics, | | | Summary | Full Text:PDF | |
| |
|
Zero-Knowledge Proof for the Independent Set Problem
Pino CABALLERO-GIL | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A
No. 5 ;
pp. 1301-1302
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
cryptography, computational complexity, algorithms, discrete mathematics, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
|
Complexity and Completeness of Finding Another Solution and Its Application to Puzzles
Takayuki YATO Takahiro SETA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/05/01
Vol. E86-A
No. 5 ;
pp. 1052-1060
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
computational complexity, NP-complete, another solution, puzzle, | | | Summary | Full Text:PDF | |
| |
| |
|
NP-Hardness of Liveness Problem of Bounded Asymmetric Choice Net
Atsushi OHTA Kohkichi TSUJI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A
No. 5 ;
pp. 1071-1074
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
concurrent system, Petri net, liveness, computational complexity, | | | Summary | Full Text:PDF | |
| |
| |
|
Polynomial Time Decidability of Monotone Liveness of Time Bounded AC/DC Nets
Atsushi OHTA Kohkichi TSUJI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/11/01
Vol. E84-A
No. 11 ;
pp. 2865-2870
Type of Manuscript:
Special Section PAPER (Special Section on Concurrent Systems Technology)
Category:
Keyword:
concurrent system, Petri net, liveness, computational complexity, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Computational Power of Nondeterministic Ordered Binary Decision Diagrams and Their Subclasses
Kazuyoshi TAKAGI Koyo NITTA Hironori BOUNO Yasuhiko TAKENAGA Shuzo YAJIMA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Vol. E80-A
No. 4 ;
pp. 663-669
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
computational complexity, Boolean function, ordered binary decision diagram, satisfiability, combinational circuit, cutwidth, sum-of-product form, zero-suppressed binary decision diagrams (BDD), ternary decision diagram, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
|