8 citations · 59 across the 30 of their papers we have counts for
Showing 2014 · cs.CCShow all
2 papers · 2 filters
cs.CC2014★ 2 cited
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness
Hubie Chen
We present and study a framework in which one can present alternation-based lower bounds on proof length in proof systems for quantified Boolean formulas. A key notion in this fram…
cs.CC2014★ 7 cited
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries
Hubie Chen, Stefan Mengel
Conjunctive queries are basic and heavily studied database queries; in relational algebra, they are the select-project-join queries. In this article, we study the fundamental probl…