Name
Abstract | ||
|---|---|---|
•Uses popular complexity theoretic hardness assumptions (SETH) to prove hardness of logic hazard detection.•Detecting logic hazards in general circuits is hard.•Detecting logic hazards in CNF and DNF formulas is easy. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ipl.2020.105980 | Information Processing Letters |
Keywords | DocType | Volume |
Computational complexity,Lower bound,Logic hazard,SETH | Journal | 162 |
ISSN | Citations | PageRank |
0020-0190 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balagopal Komarath | 1 | 4 | 3.16 |
| Nitin Saurabh | 2 | 0 | 0.34 |