Fractons on Graphs and Complexity

被引：0
|
作者：
Gorantla, Pranay [1 ]
Lam, Ho Tat [2 ]
Shao, Shu-Heng [3 ]
机构：
[1] Physics Department, Princeton University, United States
[2] Center for Theoretical Physics, Massachusetts Institute of Technology, United States
[3] C. N. Yang Institute for Theoretical Physics, Stony Brook University, United States
来源：
arXiv | 2022年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Lattice theory - Mathematical operators - Quantum theory - Trees (mathematics)
引用
收藏
相关论文
共 50 条
  • [21] Logical complexity of graphs: a survey
    Pikhurko, Oleg
    Verbitsky, Oleg
    MODEL THEORETIC METHODS IN FINITE COMBINATORICS, 2011, 558 : 129 - +
  • [22] On the Complexity of Recognizing Wheeler Graphs
    Gibney, Daniel
    Thankachan, Sharma, V
    ALGORITHMICA, 2022, 84 (03) : 784 - 814
  • [23] The complexity of specific commuting graphs
    Chen, X. Y.
    Mahmoudifar, A.
    Moghaddamfar, A. R.
    Salehzadeh, F.
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2022, 21 (06)
  • [24] Neighborhood Complexity of Planar Graphs
    Joret, Gwenael
    Rambaud, Clement
    COMBINATORICA, 2024, 44 (05) : 1115 - 1148
  • [25] On the complexity of recognizing hamming graphs and related classes of graphs
    Imrich, W
    Klavzar, S
    EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (2-3) : 209 - 221
  • [26] Cayley graphs and complexity geometry
    Lin, Henry W.
    JOURNAL OF HIGH ENERGY PHYSICS, 2019, 2019 (02)
  • [27] The complexity of searching implicit graphs
    Balcazar, JL
    ARTIFICIAL INTELLIGENCE, 1996, 86 (01) : 171 - 188
  • [28] Cayley graphs and complexity geometry
    Henry W. Lin
    Journal of High Energy Physics, 2019
  • [29] On the obfuscation complexity of planar graphs
    Verbitsky, Oleg
    THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 294 - 300
  • [30] THE COMPLEXITY OF COLORING CIRCLE GRAPHS
    UNGER, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 389 - 400
12345