Jump to main content
Volume number(8) 2007-08.10-9
Computatio...

Computational complexity of computing a partial solution for the Graph Automorphism problems

Icons representing 記事

Computational complexity of computing a partial solution for the Graph Automorphism problems

Call No. (NDL)
Z74-C801
Bibliographic ID of National Diet Library
10275762
Material type
記事
Author
Takayuki Nagoyaほか
Publisher
東京 : 日本大学文理学部情報科学研究所
Publication date
2007
Material Format
Paper
Journal name
年次研究報告書 = Annual reports of the Institute of Information Sciences / 日本大学文理学部情報科学研究所 編 (8) 2007-08.10-9
Publication Page
p.1~18
View All

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

  • CiNii Research

    Search Service
    Paper
    You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Paper

Material Type
記事
Author/Editor
Takayuki Nagoya
Seinosuke Toda
Periodical title
年次研究報告書 = Annual reports of the Institute of Information Sciences / 日本大学文理学部情報科学研究所 編
No. or year of volume/issue
(8) 2007-08.10-9
Issue
8
Pages
1~18
Publication date of volume/issue (W3CDTF)
2007
ISSN (Periodical Title)
1347-202X