On the solution of linear recurrence equations
From MaRDI portal
Publication:1384098
DOI10.1023/A:1018353700639zbMath0898.39003MaRDI QIDQ1384098
Publication date: 13 April 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items
Proving divide and conquer complexities in Isabelle/HOL, Continuous amortization and extensions: with applications to bisection-based root isolation, Synthesis with asymptotic resource bounds, Verification of Closest Pair of Points Algorithms, Improved quick hypervolume algorithm, A new asymptotic notation: Weak Theta, A new dichotomic algorithm for the uniform random generation of words in regular languages, Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm, Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis, Space-time trade-offs for stack-based algorithms, A Real Elementary Approach to the Master Recurrence and Generalizations, Unnamed Item, Hitting Forbidden Minors: Approximation and Kernelization, Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles
Cites Work
