( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Learnability of Relatively Quantified Generalized Formulas.

, , и . ALT, том 3244 из Lecture Notes in Computer Science, стр. 365-379. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Chen Chen

Chen Chen

Shih Chen Chen

Yi-Chen Chen

Chen-Loung Chen

 

Другие публикации лиц с тем же именем

Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness.. ICALP, том 55 из LIPIcs, стр. 94:1-94:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Periodic Constraint Satisfaction Problems: Tractable Subclasses.. Constraints An Int. J., 10 (2): 97-113 (2005)Arc consistency and friends., , и . J. Log. Comput., 23 (1): 87-108 (2013)The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. CoRR, (2006)The Tractability Frontier of Graph-Like First-Order Query Sets.. J. ACM, 64 (4): 26:1-26:29 (2017)A rendezvous of logic, complexity, and algebra.. ACM Comput. Surv., 42 (1): 2:1-2:32 (2009)A rendezvous of logic, complexity, and algebra.. SIGACT News, 37 (4): 85-114 (2006)How Many Variables are Needed to Express an Existential Positive Query?, и . Theory Comput. Syst., 63 (7): 1573-1594 (2019)Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms.. CP, том 3258 из Lecture Notes in Computer Science, стр. 168-181. Springer, (2004)An Algorithm for SAT Above the Threshold.. SAT, том 2919 из Lecture Notes in Computer Science, стр. 14-24. Springer, (2003)