Lower bounds for the size of expressions for certain functions in d-ary logic

DOI10.1016/0304-3975(76)90035-9zbMath0337.68030OpenAlexW2003041310MaRDI QIDQ1230507

Boštjan Vilfan

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Many-valued logic (03B50)

Related Items (1)

Some nonstandard Ramsey like applications

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

This page was built for publication: Lower bounds for the size of expressions for certain functions in d-ary logic