wiki_research

commit 3a4a8e05924485a06921f93b9e1066865a53e6f3
parent 8edd267a01ae4038e3a4553f3770ed35762c6b0e
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Thu, 20 Nov 2025 18:13:10 +0100

commit with codex

Diffstat:
core
 | 
6
+++---

1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/core b/core
@@ -7,13 +7,13 @@ The [core] of an [instance] A is a [subinstance] B of A such that there is no [h
 [computational_problem] of computing the core:
 - checking if a [graph] is its own core
   - clearly in [coNP] (guess the [homomorphism])
-  - [conp_complete]
+  - [coNP_complete]
     - https://cstheory.stackexchange.com/questions/2733/what-is-the-best-exact-algorithm-to-compute-the-core-of-a-graph
 - checking if input [graph] G is core of input [graph] H
-  - is in [dp]:
+  - is in [DP]:
     - guess existence of [homomorphism]
     - guess inexistence of other [homomorphism]
-  - is [dp_complete] by [fagin2005data2]
+  - is [DP_complete] by [fagin2005data2]
   - https://cstheory.stackexchange.com/questions/2733/what-is-the-best-exact-algorithm-to-compute-the-core-of-a-graph
 
 Up: [homomorphism]