On the computational complexity of the order polynomial
Faigle, Ulrich and Schrader, Rainer
(1986)
On the computational complexity of the order polynomial.
Published in:
Discrete Applied Mathematics Vol. 15 (2-3).
pp. 261-269.
Actions:
Content information:
Item Type: | Article |
---|---|
Citations: | No citation data. |
Uncontrolled Keywords: | |
Subjects: |
|
Divisions: | Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader Mathematical Institute > Prof. Dr. Faigle |
Related URLs: |
Deposit Information:
ZAIK Number: | UNSPECIFIED |
---|---|
Depositing User: | Archive Admin |
Date Deposited: | 30 Jun 2014 12:44 |
Last Modified: | 30 Jun 2014 12:44 |
URI: | http://e-archive.informatik.uni-koeln.de/id/eprint/729 |