✦ LIBER ✦

The computational complexity of asymptotic problems I: Partial orders

✍ Scribed by Kevin J. Compton

Book ID: 113383874
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 966 KB
Volume: 78
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(88)90032-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational complexity of computing a

Computational complexity of computing a partial solution for the Graph Automorphism problems

✍ Takayuki Nagoya; Seinosuke Toda 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 585 KB

The computational complexity of bilevel

The computational complexity of bilevel assignment problems

✍ Elisabeth Gassner; Bettina Klinz 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 282 KB

The computational complexity of decision

The computational complexity of decision problems — Basic concepts

📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 717 KB

The computational complexity of knot and

The computational complexity of knot and link problems

✍ Hass, Joel; Lagarias, Jeffrey C.; Pippenger, Nicholas 📂 Article 📅 1999 🏛 Association for Computing Machinery 🌐 English ⚖ 185 KB

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)=

The computational complexity of graph pr

The computational complexity of graph problems with succinct multigraph representation

✍ M. Karpinski; K. W. Wagner 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 451 KB