Open AccessThe Complexity of Conjunctive Queries with Degree 2
Author(s) -
Matthias Lanzinger
Publication year - 2022
Publication title -
oxford university research archive (ora) (university of oxford)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/3517804.3524152
Subject(s) - treewidth , hyperbolic tree , arity , degree (music) , conjunctive query , hypergraph , bounded function , mathematics , combinatorics , discrete mathematics , graph , theoretical computer science , computer science , pathwidth , database , line graph , mathematical analysis , physics , relational database , acoustics , hyperbolic manifold , hyperbolic function
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom