A Note on the Length of M-Programs over Nonsolvable Groups
スポンサーリンク
概要
著者
-
Toda Seinosuke
Department Of Computer Science And System Analysis College Of Humanities And Sciences Nihon Universi
-
Toda Seinosuke
Department Of Mathematics College Of Humanities And Science Nihon University
関連論文
- The Complexity of Selecting Maximal Solutions
- Grammatical Characterizations of P and PSPACE
- Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size(Invited Papers from New Horizons in Computing)
- A Note on the Length of M-Programs over Nonsolvable Groups