Perspective on complexity measures targeting read-once branching programs (Q6647765)
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: Perspective on complexity measures targeting read-once branching programs |
scientific article; zbMATH DE number 7953369
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perspective on complexity measures targeting read-once branching programs |
scientific article; zbMATH DE number 7953369 |
Statements
Perspective on complexity measures targeting read-once branching programs (English)
0 references
3 December 2024
0 references
read-once branching program
0 references
communication complexity
0 references
rectangle
0 references
subfunctions
0 references
cover number
0 references
partition number
0 references
blocking sets
0 references
tree evaluation problem
0 references
Tseitin formula
0 references
GEN function
0 references
0 references
