Hubie Chen

From MaRDI portal
Revision as of 23:38, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:361801

Available identifiers

zbMath Open chen.hubieMaRDI QIDQ361801

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60654672023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q58719082023-01-25Paper
https://portal.mardi4nfdi.de/entity/Q50094772021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q51446312021-01-19Paper
Best-case and worst-case sparsifiability of Boolean CSPs2020-08-12Paper
The Exponential Time complexity of counting (quantum) graph homomorphisms2020-02-24Paper
Asking the Metaquestions in Constraint Tractability2019-12-06Paper
Proof Complexity Modulo the Polynomial Hierarchy2019-12-06Paper
How many variables are needed to express an existential positive query?2019-09-05Paper
Constant-Query Testability of Assignments to Constraint Satisfaction Problems2019-09-02Paper
https://portal.mardi4nfdi.de/entity/Q53811212019-06-07Paper
How many variables are needed to express an existential positive query2018-07-18Paper
The Tractability Frontier of Graph-Like First-Order Query Sets2018-05-17Paper
The tractability frontier of graph-like first-order query sets2018-04-23Paper
One hierarchy spawns another2018-04-23Paper
One Hierarchy Spawns Another2018-03-22Paper
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness2017-12-19Paper
The parameterized space complexity of embedding along a path2017-10-12Paper
https://portal.mardi4nfdi.de/entity/Q53637662017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q52784012017-07-19Paper
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries2017-06-13Paper
Decomposing Quantified Conjunctive (or Disjunctive) Formulas2017-05-16Paper
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction2017-05-16Paper
Decomposing Quantified Conjunctive (or Disjunctive) Formulas2016-12-13Paper
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space2016-10-24Paper
Quantified Constraints and Containment Problems2015-10-29Paper
Tractability of quantified temporal constraints to the max2015-02-24Paper
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction2015-01-15Paper
An algebraic hardness criterion for surjective constraint satisfaction.2015-01-09Paper
The complexity of equivalence, entailment, and minimization in existential positive logic2014-11-24Paper
On the complexity of existential positive queries2014-04-16Paper
https://portal.mardi4nfdi.de/entity/Q28437232013-08-23Paper
Bounded rationality, strategy simplification, and equilibrium2013-08-19Paper
Block-Sorted Quantified Conjunctive Queries2013-08-07Paper
Generic expression hardness results for primitive positive formula comparison2013-06-06Paper
Arc consistency and friends2013-04-19Paper
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction2013-04-09Paper
On the expression complexity of equivalence and isomorphism of primitive positive formulas2012-12-06Paper
On the Complexity of MMSNP2012-08-22Paper
Meditations on Quantified Constraint Satisfaction2012-07-16Paper
Generic expression hardness results for primitive positive formula comparison2011-07-07Paper
Quantified constraint satisfaction and the polynomially generated powers property2011-06-01Paper
Quantified Equality Constraints2011-04-04Paper
The reducts of equality up to primitive positive interdefinability2011-01-12Paper
Constraint satisfaction with succinctly specified relations2010-10-07Paper
Causal graphs and structurally restricted planning2010-08-18Paper
Principles and Practice of Constraint Programming – CP 20032010-03-02Paper
Qualitative Temporal and Spatial Reasoning Revisited2010-01-14Paper
Peek arc consistency2009-12-15Paper
The complexity of constraint satisfaction games and QCSP2009-09-14Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
On-the-Fly Macros2009-07-02Paper
Relatively quantified constraint satisfaction2009-05-29Paper
Maximal infinite-valued constraint languages2009-04-29Paper
Existentially restricted quantified constraint satisfaction2009-04-16Paper
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction2009-03-12Paper
Qualitative Temporal and Spatial Reasoning Revisited2009-03-05Paper
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case2008-10-28Paper
Beyond Hypertree Width: Decomposition Methods Without Decompositions2008-09-09Paper
Principles and Practice of Constraint Programming – CP 20042008-09-09Paper
Principles and Practice of Constraint Programming – CP 20042008-09-09Paper
Inverse NP problems2008-08-20Paper
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property2008-08-19Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Maximal Infinite-Valued Constraint Languages2007-11-28Paper
Learning intersection-closed classes with signatures2007-09-18Paper
Oligomorphic clones2007-09-03Paper
Computer Science Logic2006-11-01Paper
Periodic constraint satisfaction problems: Tractable subclasses2006-02-23Paper
The expressive rate of constraints2006-01-23Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
STACS 20052005-12-02Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Algorithmic Learning Theory2005-08-18Paper
A coalgebraic approach to Kleene algebra with tests2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q44756472004-08-09Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hubie Chen