Exact complexity and satisfiability (invited talk)

被引：0
|
作者：
Department of Computer Science and Engineering, University of California, San Diego, San Diego, CA 92093-0404, United States [1 ]
机构：
来源：
Lect. Notes Comput. Sci. | / 1-3期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Computational complexity
引用
收藏
相关论文
共 50 条
  • [31] Complexity of subtype satisfiability over posets
    Niehren, J
    Priesnitz, T
    Su, ZD
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2005, 3444 : 357 - 373
  • [32] Computational Complexity of Quantum Satisfiability Foreword
    Tardos, Eva
    JOURNAL OF THE ACM, 2016, 63 (02)
  • [33] Itemset frequency satisfiability: Complexity and axiomatization
    Calders, Toon
    THEORETICAL COMPUTER SCIENCE, 2008, 394 (1-2) : 84 - 111
  • [34] The Complexity of Satisfiability of Small Depth Circuits
    Calabro, Chris
    Impagliazzo, Russell
    Paturi, Ramamohan
    PARAMETERIZED AND EXACT COMPUTATION, 2009, 5917 : 75 - 85
  • [35] Climbing Algorithms (Invited Talk)
    Levin, Leonid A.
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 2 - 3
  • [36] Semantic Search (Invited talk)
    Baeza-Yates, Ricardo
    2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2017, : 3570 - 3570
  • [37] Invited talk: Active networks
    Tennenhouse, D
    PROCEEDINGS OF THE SECOND SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDI '96), 1996, : 89 - 89
  • [38] On the Complexity of Circuit Satisfiability (Extended Abstract)
    Paturi, Ramamohan
    Pudlak, Pavel
    STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 241 - 249
  • [39] Recursion and probability (Invited talk)
    Yannakakis, Mihalis
    Fourth IFIP International Conference on Theoretical Computer Science - TCS 2006, 2006, 209 : 13 - 13
  • [40] On variable-weighted exact satisfiability problems
    Porschen, Stefan
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2007, 51 (01) : 27 - 54
12345