The following pages link to Harald Zankl (Q352958):
Displaying 31 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- KBO orientability (Q846165) (← links)
- Increasing interpretations (Q1044231) (← links)
- Labelings for decreasing diagrams (Q2352504) (← links)
- Ordinals and Knuth-Bendix Orders (Q2891472) (← links)
- KBCV – Knuth-Bendix Completion Visualizer (Q2908523) (← links)
- (Q2911632) (← links)
- Layer Systems for Proving Confluence (Q2946770) (← links)
- Beyond Peano Arithmetic – Automatically Proving Termination of the Goodstein Sequence (Q2958394) (← links)
- Confluence by Decreasing Diagrams – Formalized (Q2958395) (← links)
- (Q2985126) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- Satisfiability of Non-linear (Ir)rational Arithmetic (Q3066114) (← links)
- Finding and Certifying Loops (Q3401124) (← links)
- Confluence Competition 2015 (Q3454083) (← links)
- Maximal Termination (Q3522012) (← links)
- SAT Solving for Termination Analysis with Polynomial Interpretations (Q3612476) (← links)
- Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting (Q4933331) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- (Q4993364) (← links)
- CSI – A Confluence Tool (Q5200045) (← links)
- Certified Rule Labeling (Q5277884) (← links)
- Labelings for Decreasing Diagrams. (Q5389095) (← links)
- Modular Complexity Analysis via Relative Complexity (Q5389157) (← links)
- Modular Complexity Analysis for Term Rewriting (Q5408194) (← links)
- Satisfying KBO Constraints (Q5432353) (← links)
- Constraints for Argument Filterings (Q5448809) (← links)
- Increasing Interpretations (Q5505499) (← links)
- Uncurrying for Termination (Q5505588) (← links)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
