On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/inco.2001.3040 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/INCO.2001.3040 / rank | |||
Normal rank | |||
Latest revision as of 10:29, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata |
scientific article |
Statements
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (English)
0 references
14 January 2003
0 references
computational power of randomized computations
0 references
Las Vegas computation
0 references
deterministic computation
0 references
nondeterministic computation
0 references
complexity measures
0 references
one-way communication complexity
0 references
ordered binary decision diagrams
0 references
finite automata
0 references
