✦ LIBER ✦

Equivalence Problems for Circuits over Sets of Natural Numbers

✍ Scribed by Christian Glaßer; Katrin Herr; Christian Reitwießner; Stephen Travers; Matthias Waldherr

Publisher: Springer
Year: 2008
Tongue: English
Weight: 606 KB
Volume: 46
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-008-9144-8

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

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

Complexity of Equations over Sets of Nat

Complexity of Equations over Sets of Natural Numbers

✍ Artur Jeż; Alexander Okhotin 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 559 KB

Equations over finite sets of words and

Equations over finite sets of words and equivalence problems in automata theory

✍ J. Karhumäki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1018 KB

Equivalent circuit representation for in

Equivalent circuit representation for integral formulations of electromagnetic problems

✍ H. Baudrand; D. Bajon 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 554 KB

## Abstract The purpose of this study is to investigate the resources offered by electromagnetic equivalent circuits as a tool for the systematic derivation of integral equations and also, to propose consistent models for active sources. Copyright © 2002 John Wiley & Sons, Ltd.

An asymptotic equivalent for the number

An asymptotic equivalent for the number of total preorders on a finite set

✍ J.P. Barthelemy 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 181 KB

In this note, it is shown tI!at, the number of total preorders on a finite set with n elements is equivalent, for n inkite, to n!/2(Log 2)n-r1.