Two Applications of Inductive Counting for Complementation Problems (Q3835019)
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: Two Applications of Inductive Counting for Complementation Problems |
scientific article; zbMATH DE number 4112004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two Applications of Inductive Counting for Complementation Problems |
scientific article; zbMATH DE number 4112004 |
Statements
Two Applications of Inductive Counting for Complementation Problems (English)
0 references
1989
0 references
symmetric computation
0 references
random walk
0 references
NC
0 references
semi-unboundedness
0 references
hierarchy
0 references
inductive counting
0 references
complementation
0 references
probabilistic algorithm
0 references
connectivity
0 references
LOGCFL
0 references
pebbling
0 references
0.8197622299194336
0 references
0.7654086351394653
0 references
0.7649794816970825
0 references
0.7631269097328186
0 references
