The complexity of cover graph recognition for some varieties of finite lattices (Q1908932): Difference between revisions

@@ Property / cites work @@
+There are infinitely many Carmichael numbers
@@ Property / cites work: There are infinitely many Carmichael numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected Graphs Realizable as Graphs of Modular Lattices
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5733553
@@ Property / cites work: Q5733553 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of diagram testing
@@ Property / cites work: On the complexity of diagram testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Complexity of diagrams
@@ Property / cites work: Complexity of diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Q3291034
@@ Property / cites work: Q3291034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3222890
@@ Property / cites work: Q3222890 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge disjoint placement of graphs
@@ Property / cites work: Edge disjoint placement of graphs / rank @@
+Normal rank