Time-space trade-offs for branching programs (Q1076517): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0000(86)90004-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2013173685 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5545524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3690219 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3757396 / rank | |||
Normal rank |
Latest revision as of 13:30, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Time-space trade-offs for branching programs |
scientific article |
Statements
Time-space trade-offs for branching programs (English)
0 references
1986
0 references
complexity of branching programs
0 references
Boolean function
0 references
0 references