z-logo
open-access-imgOpen Access
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
Author(s) -
Jacob Focke,
Leslie Ann Goldberg,
Marc Roth,
Stanislav Živný
Publication year - 2022
Publication title -
oxford university research archive (ora) (university of oxford)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/3517804.3526231
Subject(s) - arity , treewidth , bounded function , conjunctive query , negation , mathematics , upper and lower bounds , combinatorics , exponential function , discrete mathematics , polynomial , computer science , pathwidth , data mining , mathematical analysis , graph , line graph , relational database , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom