Pages that link to "Item:Q1321032"
From MaRDI portal
The following pages link to The complexity of computing maximal word functions (Q1321032):
Displaying 9 items.
- The intractability of computing the Hamming distance (Q557834) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- A note on logspace optimization (Q1904668) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- String distances and intrusion detection: Bridging the gap between formal languages and computer security (Q3431441) (← links)
- How hard is to compute the edit distance (Q5055912) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
