A finite set of functions with an EXPTIME-complete composition problem (Q955009): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2008.06.057
+Normal rank
@@ Property / OpenAlex ID @@
+W1981616529
@@ Property / OpenAlex ID: W1981616529 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of searching implicit graphs
@@ Property / cites work: The complexity of searching implicit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
@@ Property / cites work: COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE / rank @@
+Normal rank
@@ Property / cites work @@
+Q3934450
@@ Property / cites work: Q3934450 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4299345
@@ Property / cites work: Q4299345 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5509690
@@ Property / cites work: Q5509690 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a perfect strategy for nxn chess requires time exponential in n
+Normal rank
@@ Property / cites work @@
+Composing Functions to Minimize Image Size
@@ Property / cites work: Composing Functions to Minimize Image Size / rank @@
+Normal rank
@@ Property / cites work @@
+INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
+Normal rank
@@ Property / cites work @@
+The subdirectly irreducible algebras in the variety generated by graph algebras
+Normal rank
@@ Property / cites work @@
+GO Is Polynomial-Space Hard
@@ Property / cites work: GO Is Polynomial-Space Hard / rank @@
+Normal rank
@@ Property / cites work @@
+THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
+Normal rank
@@ Property / cites work @@
+Q3751631
@@ Property / cites work: Q3751631 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>N</i> by <i>N</i> Checkers is Exptime Complete
@@ Property / cites work: <i>N</i> by <i>N</i> Checkers is Exptime Complete / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
+Normal rank