𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Linear and Stratified Context Matching Problems

✍ Scribed by Manfred Schmidt-Schauß; Jürgen Stuber

Book ID
105914760
Publisher
Springer
Year
2004
Tongue
English
Weight
253 KB
Volume
37
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of almost linear diophant
The complexity of almost linear diophantine problems
✍ V. Weispfenning 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 542 KB

We studied formulas of elementary number theory resulting from formulas of Presburger arithmetic PrA (additive elementary theory of integers with order) by substituting for some variables, polynomials and integer values of rational functions in a single new variable y, and quantifying over y. We sho

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=