Browse by Person

ACM SIGACT News

Chen, Hubie (2006) A rendezvous of logic, complexity, and algebra. ACM SIGACT News 37 (4), pp. 85-114.

ACM Transactions on Computation Theory

Chen, Hubie (2017) Proof complexity modulo the Polynomial Hierarchy: understanding alternation as a source of hardness. ACM Transactions on Computation Theory 9 (3), ISSN 1942-3454.

Chen, Hubie and Muller, M. (2015) The fine classification of conjunctive queries and parameterized logarithmic space. In: UNSPECIFIED (ed.) PODS '13 Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems. New York, U.S.: ACM Publications, pp. 309-320. ISBN 9781450320665.

ACM Transactions on Computational Logic

Chen, Hubie and Mueller, M. (2017) One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. ACM Transactions on Computational Logic 18 (4), ISSN 1529-3785.

Chen, Hubie (2014) On the complexity of Existential Positive Queries. ACM Transactions on Computational Logic 15 (1), ISSN 1529-3785.

Annals of Mathematics and Artificial Intelligence

Chen, Hubie (2005) The expressive rate of constraints. Annals of Mathematics and Artificial Intelligence 44 (4), pp. 341-352. ISSN 1012-2443.

CoRR

Chen, Hubie (2006) Logic column 17: a rendezvous of logic, complexity, and algebra. CoRR ,

Chen, Hubie (2006) The complexity of quantified constraint satisfaction: collapsibility, sink algebras, and the three-element case. CoRR ,

Chen, Hubie (2005) Existentially restricted quantified constraint satisfaction. CoRR ,

Chen, Hubie and Pucella, R. (2004) A coalgebraic approach to Kleene algebra with tests. CoRR ,

Constraints

Chen, Hubie (2005) Periodic constraint satisfaction problems: tractable subclasses. Constraints 10 (2), pp. 97-113. ISSN 1383-7133.

Electronic Colloquium on Computational Complexity

Chen, Hubie (2005) Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms. Electronic Colloquium on Computational Complexity 036 , ISSN 1433-8092.

Chen, Hubie (2001) Arithmetic versions of constant depth circuit complexity classes. Electronic Colloquium on Computational Complexity (095), ISSN 1433-8092.

Chen, Hubie (2001) Polynomial programs and the Razborov-Smolensky method. Electronic Colloquium on Computational Complexity 8 (067), ISSN 1433-8092.

Electronic Notes in Theoretical Computer Science

Chen, Hubie and Pucella, R. (2003) A coalgebraic approach to Kleene algebra with tests. Electronic Notes in Theoretical Computer Science 82 (1), pp. 94-109. ISSN 1571-0661.

Journal of Machine Learning Research

Chen, Hubie and Valeriote, M. (2019) Learnability of solutions to conjunctive queries. Journal of Machine Learning Research 20 (67), pp. 1-28. ISSN 1532-4435.

Journal of the ACM

Chen, Hubie (2017) The Tractability Frontier of Graph-Like First-Order Query Sets. Journal of the ACM 64 (4), pp. 1-29. ISSN 000-45411.

Chen, Hubie (2014) The tractability frontier of graph-like first-order query sets. In: UNSPECIFIED (ed.) CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York, U.S.: ACM Publications. ISBN 9781450328869.

SIAM Journal on Computing

Chen, Hubie and Valeriote, M. and Yoshida, Y. (2019) Constant-query testability of assignments to constraint satisfaction problems. SIAM Journal on Computing 48 (3), pp. 1022-1045. ISSN 1095-7111.

Chen, Hubie and Dalmau, V. (2016) Decomposing quantified conjunctive (or disjunctive) formulas. SIAM Journal on Computing 45 (6), pp. 2066-2086. ISSN 0097-5397.

Theoretical Computer Science

Bulatov, A.A. and Chen, Hubie and Dalmau, V. (2007) Learning intersection-closed classes with signatures. Theoretical Computer Science 382 (3), pp. 209-220. ISSN 0304-3975.

Chen, Hubie and Pucella, R. (2004) A coalgebraic approach to Kleene algebra with tests. Theoretical Computer Science 327 (1-2), pp. 23-44. ISSN 0304-3975.

Theory of Computing Systems

Bova, S. and Chen, Hubie (2018) How many variables are needed to express an existential positive query? Theory of Computing Systems 63 (152), pp. 1573-1594. ISSN 1432-4350.