Pages that link to "Item:Q2088618"
From MaRDI portal
The following pages link to Finitely generated structures computable in polynomial time (Q2088618):
Displaying 6 items.
- Structures computable in polynomial time. I (Q2401536) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- A criterion for P-computability of structures (Q6072994) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
- The complexity of inversion in groups (Q6199353) (← links)
- Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal (Q6641147) (← links)