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:
Full text not available from this repository.
Export as:
Editorial actions: View Item View Item (Login required)
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