BEARdocs

Why is Symmetry So Hard?

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Maurer
dc.identifier.uri http://hdl.handle.net/2104/8184
dc.description.abstract The problem of detecting virtually any type of symmetry is shown to be co-NP-complete. We start with totally symmetric functions, then extend the result to partially symmetric functions, then to more general cofactor relations, and finally to generic permutation-group symmetries. We also show that the number of types of symmetry grows substantially with the number of inputs, compounding the complexity of an already difficult problem. en
dc.subject Symmetric Boolean Functions en
dc.subject NP-Completeness en
dc.subject Conjugate Symmetry en
dc.subject Generalized Symmetry en
dc.title Why is Symmetry So Hard? en
dc.license GPL en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search BEARdocs


Advanced Search

Browse

My Account

Statistics