Efficient Enumeration of All Pseudoline Arrangements

スポンサーリンク

概要

• 論文の詳細を見る
• 2009-05-11

著者

• MATSUI Yasuko

  Department of Medicinal Chemistry, Center for Frontier Research in Medicinal Science, Kyoto Pharmace

• YAMANAKA KATSUHISA

  Graduate School of Information Systems, University of Electro-communications

• NAKANO SHIN-ICHI

  Department of Computer Science, Gunma University

• UEHARA Ryuhei

  School of Information Science, JAIST

• Matsui Yasuko

  Department Of Mathematical Sciences Tokai University

• NAKADA KENTO

  Research Institute for Mathematical Sciences, Kyoto University

関連論文

• Design and Synthesis of Dipeptide-type HIV-1 Protease Inhibitors with High Antiviral Activity
• Bipartite powers of interval bigraphs
• Enumerating All Rooted Trees Including k Leaves
• Efficient Enumeration of All Pseudoline Arrangements
• Constant Time Generation of Integer Partitions(Discrete Mathematics and Its Applications)
• An Approach for Peptidic Aspartic Protease Inhibitors Using Ala-containing Oligopeptides Independent of the Substrate Sequence
• Computational Complexities of University Interview Timetabling
• Efficient Enumeration of All Pseudoline Arrangements
• Effects of propofol and thiopental on the central nervous system during nociceptive stimulation in cats
• Satellite Cell Differentiation in Goat Skeletal Muscle Single Fiber Culture
• Infinite Pre-dominant Integral Weights for Affine Types (New Trends in Combinatorial Representation Theory)
• FOREWORD
• Special Section on Discrete Mathematics and Its Applications

もっと見る 閉じる

スポンサーリンク