Pages that link to "Item:Q3893301"
From MaRDI portal
The following pages link to On the Computational Complexity of Program Scheme Equivalence (Q3893301):
Displayed 13 items.
- Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386) (← links)
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
- The complexity of monadic recursion schemes: executability problems, nesting depth, and applications (Q792758) (← links)
- The complexity of monadic recursion schemes: Exponential time bounds (Q796301) (← links)
- Weak equivalence in a class of structured program schemes (Q797988) (← links)
- Some simplified undecidable and NP-hard problems for simple programs (Q1157168) (← links)
- On the complexity of simple arithmetic expressions (Q1162150) (← links)
- On the zero-inequivalence problem for loop programs (Q1171383) (← links)
- Average case completeness (Q1176231) (← links)
- An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines (Q1239606) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
- A note on the complexity of program evaluation (Q3319774) (← links)