Pages that link to "Item:Q3839875"
From MaRDI portal
The following pages link to COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (Q3839875):
Displayed 11 items.
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- Testing for a semilattice term (Q1732802) (← links)
- On the complexity of the Leibniz hierarchy (Q1740630) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS (Q2854972) (← links)
- GENCLO AND TERMEQUIV ARE EXPTIME-COMPLETE (Q3528857) (← links)
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS (Q3621430) (← links)
- Complexity of term representations of finitary functions (Q4687485) (← links)
- COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA (Q4791998) (← links)
- Idempotent <i>n</i> -permutable varieties (Q5495357) (← links)