Approximate Counting with Deterministic Guarantees for Affinity Computation (Q5357750)
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: Approximate Counting with Deterministic Guarantees for Affinity Computation |
scientific article; zbMATH DE number 6774248
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Counting with Deterministic Guarantees for Affinity Computation |
scientific article; zbMATH DE number 6774248 |
Statements
Approximate Counting with Deterministic Guarantees for Affinity Computation (English)
0 references
12 September 2017
0 references
computational protein design
0 references
protein-ligand affinity
0 references
constraint programming
0 references
cost function network
0 references
soft arc consistency
0 references
counting problems
0 references
weighted \#CSP
0 references
