An O(N/sup 2/) algorithm for discovering optimal Boolean pattern pairs | IEEE Journals & Magazine | IEEE Xplore

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

  翻译：