Approximate counting and NP search problems (Q5055313)
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 and NP search problems |
scientific article; zbMATH DE number 7632519
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate counting and NP search problems |
scientific article; zbMATH DE number 7632519 |
Statements
Approximate counting and NP search problems (English)
0 references
13 December 2022
0 references
bounded arithmetic
0 references
NP search problems
0 references
approximate counting
0 references
weak pigeonhole principle
0 references
CPLS
0 references
switching lemmas
0 references
0 references
0 references
0 references
0 references
0 references
0.9383698
0 references
0.9245526
0 references
0.9192575
0 references
0.90664995
0 references
0 references
0.90134776
0 references
0.90006053
0 references
