Yijia Chen

From MaRDI portal
Person:490657

Available identifiers

zbMath Open chen.yijiaMaRDI QIDQ490657

List of research outcomes





PublicationDate of PublicationType
On algorithms based on finitely many homomorphism counts2024-08-06Paper
Forbidden induced subgraphs and the Łoś-Tarski theorem2024-05-29Paper
https://portal.mardi4nfdi.de/entity/Q61610592023-06-26Paper
Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique2023-04-15Paper
FO-Definability of Shrub-Depth2023-02-07Paper
A parameterized halting problem, $\Delta_0$ truth and the MRDP theorem2022-11-11Paper
Parameterized Parallel Computing and First-Order Logic2022-11-09Paper
The Complexity of Homomorphism Indistinguishability2022-07-21Paper
Game-theoretic analysis of Guts Poker2021-08-14Paper
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem2021-01-20Paper
Tree-depth, quantifier elimination, and quantifier rank2021-01-20Paper
Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.2020-05-26Paper
https://portal.mardi4nfdi.de/entity/Q49727292019-11-26Paper
Some lower bounds in parameterized \(\mathrm{AC}^{0}\)2019-05-29Paper
The Constant Inapproximability of the Parameterized Dominating Set Problem2019-05-07Paper
Some Lower Bounds in Parameterized AC^0.2018-03-21Paper
The hardness of embedding grids and walls2018-01-04Paper
On the Ordered Conjecture2017-05-16Paper
The parameterized complexity of \(k\)-edge induced subgraphs2016-12-22Paper
The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture2015-09-22Paper
Hard Instances of Algorithms and Proof Systems2015-09-03Paper
Consistency, optimality, and incompleteness2015-08-27Paper
On optimal inverters2014-10-21Paper
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem2014-10-14Paper
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem2014-02-17Paper
The Parameterized Complexity of k-Edge Induced Subgraphs2013-08-12Paper
The Exponential Time Hypothesis and the Parameterized Clique Problem2013-01-07Paper
A Parameterized Halting Problem2012-09-05Paper
Hard Instances of Algorithms and Proof Systems2012-08-14Paper
Strong isomorphism reductions in complexity theory2011-12-23Paper
Consistency and Optimality2011-09-09Paper
Lower bounds for kernelizations and other preprocessing procedures2011-05-25Paper
On p-Optimal Proof Systems and Logics for PTIME2010-09-07Paper
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT2010-09-03Paper
A Logic for PTIME and a Parameterized Halting Problem2010-09-03Paper
Lower Bounds for Kernelizations and Other Preprocessing Procedures2010-07-28Paper
On the complexity of Gödel's proof predicate2010-03-15Paper
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping2009-03-05Paper
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping2009-03-02Paper
Understanding the Complexity of Induced Subgraph Isomorphisms2008-08-28Paper
An Isomorphism Between Subexponential and Parameterized Complexity Theory2008-08-14Paper
On Parameterized Approximability2008-06-03Paper
The Parameterized Complexity of Maximality and Minimality Problems2008-06-03Paper
The parameterized complexity of maximality and minimality problems2008-02-13Paper
An analysis of the W*-hierarchy2007-07-09Paper
Computer Science Logic2007-06-21Paper
On miniaturized problems in parameterized complexity theory2006-04-06Paper
Parameterized and Exact Computation2005-08-23Paper
Machine-based methods in parameterized complexity theory2005-06-30Paper
https://portal.mardi4nfdi.de/entity/Q46818132005-06-29Paper
https://portal.mardi4nfdi.de/entity/Q44456902004-02-02Paper
https://portal.mardi4nfdi.de/entity/Q47833032002-12-04Paper
https://portal.mardi4nfdi.de/entity/Q45211232001-07-16Paper

Research outcomes over time

This page was built for person: Yijia Chen