English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We devise a framework for proving tight lower bounds under the countingexponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions onAlgorithms, 2014). Our framework allows us to convert classical #P-hardnessresults for counting problems into tight lower bounds under #ETH, thus rulingout algorithms with running time $2^{o(n)}$ on graphs with $n$ vertices and$O(n)$ edges. As exemplary applications of this framework, we obtain tightlower bounds under #ETH for the evaluation of the zero-one permanent, thematching polynomial, and the Tutte polynomial on all non-easy points except forone line. This remaining line was settled very recently by Brand et al. (IPEC2016).

Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity