The complexity of checking consistency of pedigree information and related problems. (Q5897359)
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: The complexity of checking consistency of pedigree information and related problems. |
scientific article; zbMATH DE number 5674155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of checking consistency of pedigree information and related problems. |
scientific article; zbMATH DE number 5674155 |
Statements
Theoretical Computer Science (English)
0 references
23 February 2010
0 references
0.8687266111373901
0 references
0.8116254806518555
0 references
0.7485714554786682
0 references
0.7475589513778687
0 references
0.7456470131874084
0 references
