Kettle, Neil, King, Andy (2006) Proof of New Decompositional Results for Generalized Symmetries (appendix for journal paper). University of Kent, School of Computing, University of Kent, Canterbury, Kent, CT2 7NF, 10 pp. (KAR id:14437)
Postscript
Language: English |
|
Download this file (Postscript/236kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
This note provides proof of some new decompositional results for generalized symmetries in ROBDDs. These results permit generalized symmetries to be found with algorithms that are formulated as a series of passes one for each variable in the ROBDD, which is the basis of the anytime approach to symmetry detection.
Item Type: | Research report (external) |
---|---|
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 24 Nov 2008 18:03 UTC |
Last Modified: | 05 Nov 2024 09:48 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/14437 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):