New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract) (Q3559784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract) |
scientific article; zbMATH DE number 5705603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract) |
scientific article; zbMATH DE number 5705603 |
Statements
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (English)
0 references
7 May 2010
0 references
0.9341862797737122
0 references
0.7481569647789001
0 references
0.7241542339324951
0 references
0.7204046845436096
0 references
