BEARdocs

Browsing by Subject "NP-Completeness"

DSpace/Manakin Repository

Browsing by Subject "NP-Completeness"

Sort by: Order: Results:

  • Maurer, Peter M.
    The characterization of the symmetries of boolean functions is important both in automatic layout synthesis, and in automatic verification of manually created layouts. It is possible to characterize the symmetries of an ...
  • Maurer
    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 ...

Search BEARdocs

Browse

My Account