Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(03)00230-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997711080 / rank | |||
Normal rank | |||
Latest revision as of 10:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Functions that have read-once branching programs of quadratic size are not necessarily testable |
scientific article |
Statements
Functions that have read-once branching programs of quadratic size are not necessarily testable (English)
0 references
28 April 2009
0 references
computational complexity
0 references
binary decision diagrams
0 references
branching programs
0 references
property testing
0 references
0 references
