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 条
  • [1] On the parameterized complexity of exact satisfiability problems
    Kneis, J
    Mölle, D
    Richter, S
    Rossmanith, P
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, 2005, 3618 : 568 - 579
  • [2] Complexity of Propositional Proofs (Invited Talk)
    Razborov, Alexander
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 340 - 342
  • [3] The complexity of distinguishing distributions (Invited talk)
    Baigneres, Thomas
    Vaudenay, Serge
    [J]. INFORMATION THEORETIC SECURITY, PROCEEDINGS, 2008, 5155 : 210 - 222
  • [4] Towards Soft Exact Computation (Invited Talk)
    Yap, Chee
    [J]. COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING (CASC 2019), 2019, 11661 : 12 - 36
  • [5] The Complexity of Information Theoretic Secure Computation (INVITED TALK)
    Ishai, Yuval
    [J]. 2012 IEEE INFORMATION THEORY WORKSHOP (ITW), 2012, : 80 - 80
  • [6] Classical Simulation and Complexity of Quantum Computations (Invited Talk)
    Jozsa, Richard
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 252 - 258
  • [7] Continuous Problems: Optimality, Complexity, Tractability (Invited Talk)
    Plaskota, Leszek
    [J]. COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2014, 2014, 8660 : 357 - 372
  • [8] Complexity bounds for ordinal-based termination: (Invited Talk)
    [J]. Schmitz, Sylvain, 1600, Springer Verlag (8762):
  • [9] Invited Talk: The Inherent Complexity of Transactional Memory and What To Do About It
    Attiya, Hagit
    [J]. PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 1 - 5
  • [10] New algorithms for Exact Satisfiability
    Byskov, JM
    Madsen, BA
    Skjernaa, B
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 332 (1-3) : 515 - 541
12345