"A polynomial time algorithm for computing all minimal decompositions of a ..."

Raoul Blankertz (2014)

> Home

Details and statistics

DOI: 10.1145/2644288.2644292

access: closed

type: Journal Article

metadata version: 2020-03-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cca/Blankertz14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cca/Blankertz14
Raoul Blankertz:
A polynomial time algorithm for computing all minimal decompositions of a polynomial. ACM Commun. Comput. Algebra 48(1/2): 13-23 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.