WHITEHEAD APPROXIMATION TO BRADLEY + EXPERIENCE, RELATIONS, TIME AND GOD IN 2 PHILOSOPHERS

被引:0
|
作者
FORD, LS
MCHENRY, L
机构
关键词
D O I
10.5840/idstudies1993232/314
中图分类号
B [哲学、宗教];
学科分类号
01 ; 0101 ;
摘要
引用
收藏
页码:103 / 109
页数:7
相关论文
共 50 条
  • [31] An Empirical Real-Time Approximation of Waiting Time Distribution in MMPP(2)/D/1
    Kang, Sang H.
    Sung, Dan K.
    Choi, Bong D.
    IEEE COMMUNICATIONS LETTERS, 1998, 2 (01) : 17 - 19
  • [32] Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time
    Behnezhad, Soheil
    Lacki, Jakub
    Mirrokni, Vahab
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2492 - 2508
  • [33] A 2-approximation for the bounded treewidth sparsest cutproblem in FPT Time
    Cohen-Addad, Vincent
    Moemke, Tobias
    Verdugo, Victor
    MATHEMATICAL PROGRAMMING, 2024, 206 (1-2) : 479 - 495
  • [34] Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time
    Behnezhad, Soheil
    Lacki, Jakub
    Mirrokni, Vahab
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2492 - 2508
  • [35] A polynomial time approximation scheme for dense MIN 2SAT
    Bazgan, C
    de la Vega, WF
    FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 91 - 99
  • [36] A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
    Buchbinder, Niv
    Feldman, Moran
    Naor, Joseph
    Schwartz, Roy
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 649 - 658
  • [37] A Single-Exponential Time 2-Approximation Algorithm for Treewidth
    Korhonen, Tuukka
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 184 - 192
  • [38] DIFFUSION APPROXIMATION FOR THE STOCHASTIC SELECTION MODEL WITH TIME DURATION .2.
    IIZUKA, M
    MATSUDA, H
    JAPANESE JOURNAL OF GENETICS, 1980, 55 (06): : 458 - 458
  • [39] ROTON 2ND SOUND IN RELAXATION-TIME APPROXIMATION
    WEISS, K
    PHYSICAL REVIEW B, 1977, 15 (09): : 4227 - 4233
  • [40] A TIGHT LINEAR TIME (1/2)-APPROXIMATION FOR UNCONSTRAINED SUBMODULAR MAXIMIZATION
    Buchbinder, Niv
    Feldman, Moran
    Naor, Joseph
    Schwartz, Roy
    SIAM JOURNAL ON COMPUTING, 2015, 44 (05) : 1384 - 1402