-
1
-
-
0001485022
-
Qualitative economics and the scope of the correspondence principle
-
L. Bassett, J. Maybee, and J. Quirk, Qualitative economics and the scope of the correspondence principle, Econometrica 36:544-563 (1968).
-
(1968)
Econometrica
, vol.36
, pp. 544-563
-
-
Bassett, L.1
Maybee, J.2
Quirk, J.3
-
5
-
-
0024132962
-
Polytopes, permanents, and graphs with large factors
-
P. Dagum, M. Luby, M. Mihail, and U. Vazirani, Polytopes, permanents, and graphs with large factors, in Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1988.
-
(1988)
Proceedings of the 27th IEEE Symposium on Foundations of Computer Science
-
-
Dagum, P.1
Luby, M.2
Mihail, M.3
Vazirani, U.4
-
7
-
-
0039923856
-
A Fibonacci matrix and the permanent function
-
B. W. King and F. D. Parker, A Fibonacci matrix and the permanent function, Fibonacci Quart. 7:539-544 (1969).
-
(1969)
Fibonacci Quart.
, vol.7
, pp. 539-544
-
-
King, B.W.1
Parker, F.D.2
-
8
-
-
0041110816
-
Permanents of cyclic (0, 1) matrices
-
N. Metropolis, M. L. Stein, and P. R. Stein, Permanents of cyclic (0, 1) matrices, J. Combin. Theory Ser. B 7:291-321 (1969).
-
(1969)
J. Combin. Theory Ser. B
, vol.7
, pp. 291-321
-
-
Metropolis, N.1
Stein, M.L.2
Stein, P.R.3
-
10
-
-
0039331467
-
Recurrence formulas for permanents of (0, 1) circulants
-
H. Minc, Recurrence formulas for permanents of (0, 1) circulants, Linear Algebra Appl. 71:241-265 (1985).
-
(1985)
Linear Algebra Appl.
, vol.71
, pp. 241-265
-
-
Minc, H.1
-
11
-
-
38249036109
-
Permanental compounds and permanents of (0, 1) circulants
-
H. Minc, Permanental compounds and permanents of (0, 1) circulants, Linear Algebra Appl. 86:11-42 (1987).
-
(1987)
Linear Algebra Appl.
, vol.86
, pp. 11-42
-
-
Minc, H.1
-
13
-
-
0009376738
-
Characterization of even directed graphs
-
P. Seymour and C. Thomassen, Characterization of even directed graphs, J. Combin. Theory B 42:36-45 (1987).
-
(1987)
J. Combin. Theory B
, vol.42
, pp. 36-45
-
-
Seymour, P.1
Thomassen, C.2
-
14
-
-
49249151236
-
The complexity of computing the permanent
-
L. G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8:189-201 (1979).
-
(1979)
Theoret. Comput. Sci.
, vol.8
, pp. 189-201
-
-
Valiant, L.G.1
-
16
-
-
0024611070
-
3, 3-free graphs and related problems
-
3, 3-free graphs and related problems, Inform. and Comput. 80:152-164 (1989).
-
(1989)
Inform. and Comput.
, vol.80
, pp. 152-164
-
-
Vazirani, V.V.1
|