Abstract
Deciding isomorphism of balanced incomplete block designs is polynomial time equivalent to deciding graph isomorphism or isomorphism complete. Deciding isomorphism of (r, λ)-systems, exact set packings, pairwise balanced designs, and partially balanced incomplete block designs are all isomorphism complete problems. Isomorphism of exact set packings is isomorphism complete, isomorphism of pairwise balanced incomplete block designs (PBIBD's) is isomorphism complete, isomorphism of pairwise balanced designs (PBD's) is isomorphism complete, and balanced incomplete block designs (BIBD) isomorphism is isomorphism complete.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
