A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph (Mathematical engineering technical reports ; METR 2011-8)

A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph

(Mathematical engineering technical reports ; METR 2011-8)

Call No. (NDL): MA21-B722
Bibliographic ID of National Diet Library: 024038244

Material type: 図書

Author: Taisei Kudo, Akimichi Takemura [著]

Publisher: Department of Mathematical Informatics, Graduate School of Information Science and Technology, the University of Tokyo

Publication date: 2011.2

Material Format: Paper

Capacity, size, etc.: 12p ; 30cm

NDC: -

View All

Search by Bookstore

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: 図書
Title: A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
Title Transcription: A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
Author/Editor: Taisei Kudo, Akimichi Takemura [著]
Series Title: Mathematical engineering technical reports ; METR 2011-8
Publication, Distribution, etc.: Tokyo : Department of Mathematical Informatics, Graduate School of Information Science and Technology, the University of Tokyo
Publication Date: 2011.2
Publication Date (W3CDTF): 2011
Extent: 12p
Size: 30cm
Place of Publication (Country Code): JP
Text Language Code: eng
NDLC: MA21
Target Audience: 一般
Holding library: 国立国会図書館
Call No.: MA21-B722
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 024038244
http://id.ndl.go.jp/bib/024038244
National Bibliography No. (JPNO): 22167397
Cataloging Rule: Nippon Cataloguing Rules 1987 Revised Edition
Bibliographic Record Category (NDL): 111