The computational complexity of knot and matroid polynomials
Year of publication: |
1991
|
---|---|
Authors: | Welsh, D. J. |
Institutions: | Forschungsinstitut für Diskrete Mathematik (contributor) |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
Extent: | 25 S graph. Darst 30 cm |
---|---|
Series: | Report. - Bonn : Univ., ISSN 0724-3138, ZDB-ID 1019256-6. - Vol. 91696 |
Type of publication: | Book / Working Paper |
Language: | English |
Classification: | Körper, Polynome |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Mathematik für den statistischen Grundkurs : ein Text zum Selbstunterricht
Walker, Helen M., (1971)
-
Elsner, Carsten, (2007)
-
Algebraic independence results for reciprocal sums of Fibonacci and Lucas numbers
Stein, Martin, (2012)
- More ...
-
Knots, matroids and the Ising model
Schwärzler, Werner, (1992)
-
Colouring and knot polynomials
Welsh, D. J., (1990)
-
Tutte polynomials computable in polynomial time
Oxley, J. G., (1991)
- More ...