LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Beynon, Meurig
Publisher: University of Warwick. Department of Computer Science
Languages: English
Types: Other
Subjects: QA76

Classified by OpenAIRE into

ACM Ref: TheoryofComputation_MISCELLANEOUS
A criterion for testing whether a given monotone boolean function f is planar monotone computable from the sequence of inputs xi,x2, . . . , xn, is developed in conjunction with an algorithm which (in principle) can construct a planar monotone circuit for f whenever one exists. Both the algorithm and the criterion require precomputation of the prime implicants and clauses of f.\ud \ud As an application of the theory, it is shown that monotone boolean functions whose prime implicants and clauses contain configurations of a particular type cannot be computed by planar monotone circuits. All monotone boolean functions on 4 (or fewer) inputs are shown to be planar monotone computable.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article