Trade‐off between information and computability: a technique for automated topological computations (Q4450412): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1108/03321640310474886 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089760908 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On efficient sparse integer matrix Smith normal form computations / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:02, 6 June 2024
scientific article; zbMATH DE number 2042589
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trade‐off between information and computability: a technique for automated topological computations |
scientific article; zbMATH DE number 2042589 |
Statements
Trade‐off between information and computability: a technique for automated topological computations (English)
0 references
15 February 2004
0 references
finite element-based PDE solver software systems
0 references
