The Strongest Model of Computation Obeying 0-1 Principles

被引：1
|
作者：
Levi, Tamir [1 ]
Litman, Ami [1 ]
机构：
[1] Technion Israel Inst Technol, Fac Comp Sci, IL-32000 Haifa, Israel
来源：
THEORY OF COMPUTING SYSTEMS | 2011年 / 48卷 / 02期
关键词：
Zero-one principle; Comparator networks; Sorting networks; Min max networks; Oblivious algorithms;
D O I：
10.1007/s00224-010-9257-8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The 0-1 Principle of Knuth and its many variants are well-known in the context of comparator networks. However, the comparator model is not the strongest model of computation obeying such principles. This paper studies another natural model of computation, the Min-Max model, that obeys all known 0-1 Principles. More important, it is the strongest model obeying certain variants of the 0-1 Principle.
引用
收藏
页码：374 / 388
页数：15
相关论文
共 50 条
  • [1] The Strongest Model of Computation Obeying 0-1 Principles
    Tamir Levi
    Ami Litman
    Theory of Computing Systems, 2011, 48 : 374 - 388
  • [2] DNA computation model to solve 0-1 programming problem
    Zhang, FY
    Yin, ZX
    Liu, B
    Xu, J
    BIOSYSTEMS, 2004, 74 (1-3) : 9 - 14
  • [3] DNA computation model to solve 0-1 programming problem
    Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
    不详
    Jisuanji Xuebao, 2008, 12 (2155-2159):
  • [4] DNA computation for a category-of 0-1 programming problem
    Guo, Ping
    Yu, HaiFeng
    2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 4, 2008, : 40 - 43
  • [5] The 0-1 Programming Model for the Meeting Group
    Wang, Tian-e
    Wan, Bao-cheng
    Li, Jian
    Guo, Bai-qiang
    2015 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND TECHNOLOGY (ICCST 2015), 2015, : 26 - 30
  • [6] On the 0-1 matrices whose squares are 0-1 matrices
    Wu, Honglin
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 432 (11) : 2909 - 2924
  • [7] Solution to the 0-1 Multidimensional Knapsack Problem Based on DNA Computation
    Wu, Kee-Rong
    Yeh, Chung-Wei
    INFORMATION TECHNOLOGY FOR MANUFACTURING SYSTEMS II, PTS 1-3, 2011, 58-60 : 1767 - +
  • [8] An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution
    Ando, Ei
    Kijima, Shuji
    ALGORITHMICA, 2016, 76 (04) : 1245 - 1263
  • [9] An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution
    Ei Ando
    Shuji Kijima
    Algorithmica, 2016, 76 : 1245 - 1263
  • [10] 0-1 Programming Problem Based on Sticker Model
    Zhi, Lingying
    Yin, Zhi-xiang
    2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, : 88 - 92
12345