Lower bounds for the size of expressions for certain functions in d-ary logic
From MaRDI portal
Publication:1230507
DOI10.1016/0304-3975(76)90035-9zbMath0337.68030MaRDI QIDQ1230507
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90035-9
Related Items
Cites Work
- Principles of combinatorics
- On the complexity of the marriage problem
- The Logical Complexity of Geometric Properties in the Plane
- An Improved Upper Bound for the Finite Delay of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item