The ordering principle in a fragment of approximate counting (Q2946740)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6483234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The ordering principle in a fragment of approximate counting |
scientific article; zbMATH DE number 6483234 |
Statements
The Ordering Principle in a Fragment of Approximate Counting (English)
0 references
17 September 2015
0 references
computational complexity
0 references
bounded arithmetic
0 references
polynomial local search
0 references
propositional proof complexity
0 references
0.7855004072189331
0 references
0.7173023819923401
0 references
0.7173023819923401
0 references
0.7115352153778076
0 references
0.7110341787338257
0 references
