Pages that link to "Item:Q3912019"
From MaRDI portal
The following pages link to The Complexity of the Equivalence Problem for Simple Programs (Q3912019):
Displayed 7 items.
- Simple programming languages and restricted classes of Turing machines (Q792760) (← links)
- Some simplified undecidable and NP-hard problems for simple programs (Q1157168) (← links)
- On the zero-inequivalence problem for loop programs (Q1171383) (← links)
- A note on the complexity of program evaluation (Q3319774) (← links)
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs (Q4508638) (← links)
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290) (← links)
- On the complexity of commutativity analysis (Q6184677) (← links)