✦ LIBER ✦

Complexity of Equations over Sets of Natural Numbers

✍ Scribed by Artur Jeż; Alexander Okhotin

Publisher: Springer
Year: 2009
Tongue: English
Weight: 559 KB
Volume: 48
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-009-9246-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Membership Problems fo

The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

✍ Pierre McKenzie; Klaus W. Wagner 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 404 KB

Equivalence Problems for Circuits over S

Equivalence Problems for Circuits over Sets of Natural Numbers

✍ Christian Glaßer; Katrin Herr; Christian Reitwießner; Stephen Travers; Matthias 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 606 KB

Polynomial-Space Decidable Membership Pr

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

✍ Daniel Meister 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 388 KB

Asymptotic density of certain sets of na

Asymptotic density of certain sets of natural numbers

✍ E. I. Shustin 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 310 KB

On Infinite Sum-free Sets of Natural Num

On Infinite Sum-free Sets of Natural Numbers

✍ Tomasz łuczak; Tomasz Schoen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A subset of the natural numbers is k-sum-free if it contains no solutions of the equation x 1 + } } } +x k = y, and strongly k-sum-free when it is l-sum-free for every l=2, ..., k. It is shown that every k-sum-free set with upper density larger than 1Â(k+1) is a subset of a periodic k-sum-free set a

Weakly arithmetic progressions in sets o

Weakly arithmetic progressions in sets of natural numbers

✍ Egbert Harzheim 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 186 KB