Search Results1-13 of  13

  • TAKENAGA Yasuhiko ID: 1000020236491

    UEC (2012 from CiNii)

    Articles in CiNii:27

    • NP-Completeness of Maximum Chain Problem on Puyopuyo (2006)
    • Recognizing Ordered Tree-Shellable Boolean Functions Based on OBDDs (Foundations of Computer Science) (2000)
    • Recognition of Ordered Tree-Shellable Functions Based on OBDDs (Algorithm Engineering as a New Paradigm) (2001)
  • TAKENAGA Yasuhiko ID: 9000000596566

    the Faculty of Engineering, Kyoto University (1992 from CiNii)

    Articles in CiNii:1

    • Computational Power of Memory-Based Parallel Computation Models with Communication (1992)
  • TAKENAGA Yasuhiko ID: 9000004807685

    The aouhor is with the Department of Computer Science, The University of Electro-Communications, (2001 from CiNii)

    Articles in CiNii:1

    • Recognition of Ordered Tree-Shellable Boolean Functions Based on OBDDs (2001)
  • TAKENAGA Yasuhiko ID: 9000004835881

    Articles in CiNii:1

    • Special Section on Foundations of Computer Science (2005)
  • TAKENAGA Yasuhiko ID: 9000004892670

    Faculty of Information Science, Kyoto University (1997 from CiNii)

    Articles in CiNii:1

    • Computational Power of Nondeterministic Orderd Binary Decision Diagrams and Their Subclasses (1997)
  • TAKENAGA Yasuhiko ID: 9000014350237

    Department of Computer Science and Information Mathematics, University of Electro-Communications (1998 from CiNii)

    Articles in CiNii:28

    • On Tree-Shellable Boolean Functions (1998)
    • Computational Power of a Memory - Based Parallel Computation Model with Content Addressable Memory (1992)
    • A Memory - Type Parallel Computation Model and Its Computation Power -Yet Another Approach to Supercomputing- (1990)
  • TAKENAGA Yasuhiko ID: 9000017681360

    Department of Computer Science, the University of Electro-Communications (2008 from CiNii)

    Articles in CiNii:1

    • Tree-Shellability of Restricted DNFs (2008)
  • Takenaga Yasuhiko ID: 9000004800976

    Faculty of Engineering, Kyoto University (1994 from CiNii)

    Articles in CiNii:1

    • On the Computational Power of Binary Decision Diagrams (1994)
  • Takenaga Yasuhiko ID: 9000019950850

    The University of Electro-Communications (2012 from CiNii)

    Articles in CiNii:1

    • NP-Completeness of Pandemic (2012)
  • Takenaga Yasuhiko ID: 9000290821524

    Department of Communication Engineering and Informatics, The University of Electro-Communications (2015 from CiNii)

    Articles in CiNii:1

    • Number of Three-point Tilings with Triangle Tiles (2015)
  • Yasuhiko Takenaga ID: 9000018866657

    Articles in CiNii:1

    • NP-Completeness of Pandemic (2012)
  • Yasuhiko Takenaga ID: 9000079247755

    Articles in CiNii:1

    • NP-Completeness of Pandemic (2012)
  • Yasuhiko Takenaga ID: 9000346958343

    Articles in CiNii:1

    • Number of Three-point Tilings with Triangle Tiles (2015)
Page Top