scientific article; zbMATH DE number 6698765
From MaRDI portal
Publication:2970775
Recommendations
- Towards a calculus of algorithms
- scientific article; zbMATH DE number 3637838
- On the complexity of propositional calculus formulae
- scientific article; zbMATH DE number 5263419
- Computation calculus bridging a formalization gap
- scientific article; zbMATH DE number 1210363
- scientific article; zbMATH DE number 1092235
- Non-elementary speed-ups in logic calculi
- scientific article; zbMATH DE number 1262431
Cited in
(12)- Essentially optimal computation of the inverse of generic polynomial matrices
- Linear differential equations as a data structure
- On the complexity of skew arithmetic
- Fast simplifications for Tarski formulas
- Reachability in Linear Dynamical Systems
- Computing Omega-Limit Sets in Linear Dynamical Systems
- Formal Techniques for Deriving Binary Search Algorithms
- scientific article; zbMATH DE number 3637838 (Why is no real title available?)
- scientific article; zbMATH DE number 1206051 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- Fast convolutions meet Montgomery
- Degree bounds for linear differential equations and recurrences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970775)