<?xml version="1.0" encoding="utf-8"?> <feed xmlns="http://www.w3.org/2005/Atom"> <title type="text">Recent zbMATH articles in MSC 13F25</title> <id>https://zbmath.org/atom/cc/13F25</id> <updated>2024-11-22T16:52:57.400418Z</updated> <link href="https://zbmath.org/" /> <link href="https://zbmath.org/atom/cc/13F25" rel="self" /> <generator>Werkzeug</generator> <entry xml:base="https://zbmath.org/atom/cc/13F25"> <title type="text">On the computational complexity of compressed power series</title> <id>https://zbmath.org/1545.65104</id> <updated>2024-11-22T16:52:57.400418Z</updated> <link href="https://zbmath.org/1545.65104" /> <author> <name>&quot;Karatsuba, E. A.&quot;</name> <uri>https://zbmath.org/authors/?q=ai:karatsuba.ekatherina-a</uri> </author> <content type="text">Summary: We present computational algorithms and complexity estimates for power series in which all exponents are positive integers raised to one and the same integer power \(\ge2\).</content> </entry> </feed>