language-icon Old Web
English
Sign In
Acemap > Paper > Automating Tree-Like Resolution in Time $n^{o(\log n)}$ Is ETH-Hard.

Automating Tree-Like Resolution in Time $n^{o(\log n)}$ Is ETH-Hard.

2021 
Keywords:
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []
    logo
    • CCF Conference Analysis
    • Map Galaxy
    • What's New
    © Copyright 2015-2020 Acemap, Inc. Shanghai Jiao Tong University.