Direct product primality testing of graphs is GI-hard (Q1998840): Difference between revisions

@@ Property / cites work @@
+Factoring cardinal product graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Q3005852
@@ Property / cites work: Q3005852 / rank @@
+Normal rank
@@ Property / cites work @@
+The Kronecker Product of Graphs
@@ Property / cites work: The Kronecker Product of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recursively enumerable sets of positive integers and their decision problems
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph multiplication
@@ Property / cites work: Graph multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Q5589874
@@ Property / cites work: Q5589874 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
+Normal rank
@@ Property / cites work @@
+Factoring a graph in polynomial time
@@ Property / cites work: Factoring a graph in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
+Normal rank
@@ Property / cites work @@
+Finding the prime factors of strong direct product graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Deterministic methods to find primes
@@ Property / cites work: Deterministic methods to find primes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank