The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity

✍ Scribed by Voronenko, A. A.

• Book ID: 120137593
• Publisher: Walter de Gruyter GmbH & Co. KG
• Year: 2005
• Tongue: English
• Weight: 58 KB
• Volume: 15
• Category: Article
• ISSN: 0924-9265
• DOI: 10.1163/156939205776368913