LENGTH OF A (0,1) MATRIX

被引：0

作者：

BERMAN, A

KOTZIG, A

机构：

[1] UNIV TENNESSEE,DEPT MATH,KNOXVILLE,TN 37916

[2] UNIV TENNESSEE,DEPT COMP SCI,KNOXVILLE,TN 37916

[3] UNIV MONTREAL,CTR RECH MATH,MONTREAL 101,QUEBEC,CANADA

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 1978年 / 20卷 / 03期

关键词：

D O I：

10.1016/0024-3795(78)90018-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：197 / 203

页数：7

共 50 条

[31] (0,1)-MATRICES
JAGERS, AA
AMERICAN MATHEMATICAL MONTHLY, 1979, 86 (06): : 505 - 506
[32] On a Property of the Franklin System in C[0,1] and L1[0,1]
Mikayelyan, V. G.
MATHEMATICAL NOTES, 2020, 107 (1-2) : 284 - 287
[33] TIGHTNESS OF PROBABILITIES ON C([0,1],PHI') AND D([0,1],PHI')
MITOMA, I
ANNALS OF PROBABILITY, 1983, 11 (04): : 989 - 999
[34] MUNTZ-JACKSON THEOREMS IN LP[0,1] AND C[0,1]
BAK, J
NEWMAN, DJ
AMERICAN JOURNAL OF MATHEMATICS, 1972, 94 (02) : 437 - &
[35] On existence of a universal function for L p [0,1] with p ∈(0,1)
Grigoryan, M. G.
Sargsyan, A. A.
SIBERIAN MATHEMATICAL JOURNAL, 2016, 57 (05) : 796 - 808
[36] ON THE SPECTRAL-RADIUS OF A (0,1) MATRIX RELATED TO MERTENS FUNCTION
BARRETT, WW
FORCADE, RW
POLLINGTON, AD
LINEAR ALGEBRA AND ITS APPLICATIONS, 1988, 107 : 151 - 159
[37] COMPLEXITY OF THE CLOSEST VECTOR PROBLEM IN A LATTICE GENERATED BY (0,1)-MATRIX
SZYMANSKI, BK
SINHAROY, B
INFORMATION PROCESSING LETTERS, 1992, 42 (03) : 121 - 126
[38] The number of connected components in a graph associated with a rectangular (0,1)-matrix
Chen, Sheng
Liang, Li
Tian, Yunbo
LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 487 : 74 - 85
[39] New combinatorial BER bounds for families of (0,1)-matrix codes
Jugl, E
Iversen, K
GLOBECOM 97 - IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, CONFERENCE RECORD, VOLS 1-3, 1997, : 1543 - 1547
[40] AN UPPER BOUND FOR THE PERMANENT OF A 3-DIMENSIONAL (0,1)-MATRIX
DOW, SJ
GIBSON, PM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1987, 99 (01) : 29 - 34

← 1 2 3 4 5 →