Sloan Robert H. and Szörényi Balázs and Turán György:
On k-term DNF with largest number of prime implicants.
ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, 12.
Terjedelem: 16 p.-Azonosító: 023.
(2005)
Preview |
Text
TR05_023_u.pdf - Published Version Download (157kB) | Preview |
| Item Type: | Journal Article |
|---|---|
| Journal or Publication Title: | ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY |
| Date: | 2005 |
| Volume: | 12 |
| Page Range: | Terjedelem: 16 p.-Azonosító: 023 |
| Faculty/Unit: | Faculty of Science and Informatics |
| Institution: | Szegedi Tudományegyetem |
| Language: | English |
| MTMT rekordazonosító: | 212765 |
| Related URLs: | |
| Date Deposited: | 2016. Sep. 14. 12:29 |
| Last Modified: | 2020. Jan. 15. 09:22 |
| URI: | http://publicatio.bibl.u-szeged.hu/id/eprint/9613 |
Actions (login required)
 |
View Item |
Download Statistics
Download Statistics
