Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
Saved in:
| Date: | 2013 |
|---|---|
| Main Authors: | A. Polak, D. Simson |
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Series: | Algebra and discrete mathematics |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000090629 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
by: Polak, A., et al.
Published: (2013) -
Algorithms computing \({\rm O}(n, \mathbb{Z})\)-orbits of \(P\)-critical edge-bipartite graphs and \(P\)-critical unit forms using Maple and C\#
by: Polak, Agnieszka, et al.
Published: (2018) -
Algorithms computing \({\rm O}(n, \mathbb{Z})\)-orbits of \(P\)-critical edge-bipartite graphs and \(P\)-critical unit forms using Maple and C\#
by: Polak, Agnieszka, et al.
Published: (2018) -
Algorithmic computation of principal posets using Maple and Python
by: Gąsiorek, Marcin, et al.
Published: (2018) -
Algorithmic computation of principal posets using Maple and Python
by: M. Gasiorek, et al.
Published: (2014)