PRICE OF GOLD AND N-1 PROBLEM

被引：0
|
作者：
KINDLEBERGER, CP [1 ]
机构：
[1] MIT,CAMBRIDGE,MA
来源：
ECONOMIE APPLIQUEE | 1970年 / 23卷 / 01期
关键词：
D O I：
暂无
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
引用
收藏
页码：149 / 162
页数：14
相关论文
共 50 条
  • [11] The Generation of (n, n(n-1), n-1) Permutation Group Codes for Communication Systems
    Peng, Li
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (07) : 4535 - 4549
  • [12] ON DIVIDING BY N-1
    LYERLY, SB
    PSYCHOLOGICAL REPORTS, 1961, 8 (03) : 457 - 458
  • [13] THE CAUCHY-PROBLEM FOR THE O(N), CP(N-1), AND GC(N,P) MODELS
    GINIBRE, J
    VELO, G
    ANNALS OF PHYSICS, 1982, 142 (02) : 393 - 415
  • [14] Ward N-1
    Scherr, Julian M.
    LIBRARY JOURNAL, 1955, 80 (19) : 2519 - 2520
  • [15] THE N-1 COMPASS
    ROSALER, RC
    PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1954, 42 (03): : 608 - 608
  • [16] A sharp dual Lp John ellipsoid problem for p ≤ -n-1
    Lv, Songjun
    BEITRAGE ZUR ALGEBRA UND GEOMETRIE-CONTRIBUTIONS TO ALGEBRA AND GEOMETRY, 2019, 60 (04): : 709 - 732
  • [17] THE DESULFONAMIDATION OF N-1,N-1 DIETHYL-3,5-DIBROMOSULFANILAMIDE
    MOSER, CM
    MELVILLE, GS
    JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1950, 72 (08) : 3812 - 3813
  • [18] A TFSK Transceiver Combining (n, n(n-1), n-1) Permutation Group Codes with MFSK
    Peng, Li
    Li, Gaofeng
    Liang, Kun
    Zhou, Bo
    2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 61 - 65
  • [19] 巧用(n(n-1))/2和n(n-1)解决实际问题
    陈永志
    中学教学参考, 2020, (23) : 27 - 28
  • [20] On the integers of the form n(n-1)-1
    Filipponi, P
    Brugia, O
    FIBONACCI QUARTERLY, 1999, 37 (03): : 262 - 264
12345