Upper bounds for reversible circuits based on Young subgroups (Q2446569): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59242326, #quickstatements; #temporary_batch_1707161894653 |
Created claim: DBLP publication ID (P1635): journals/ipl/AbdessaiedSTD14, #quickstatements; #temporary_batch_1731508824982 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.01.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085990156 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reversible Computing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Young subgroups for reversible computers. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On figures of merit in reversible and quantum logic designs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: White Dots do Matter: Rewriting Reversible Logic Circuits / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ipl/AbdessaiedSTD14 / rank | |||
Normal rank | |||
Latest revision as of 16:10, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds for reversible circuits based on Young subgroups |
scientific article |
Statements
Upper bounds for reversible circuits based on Young subgroups (English)
0 references
17 April 2014
0 references
combinatorial problems
0 references
reversible functions
0 references
upper bounds
0 references
synthesis
0 references
