On the complexity of detecting hazards (Q2203575): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2020.105980 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3033867911 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 2006.10592 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of hazard-free circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hazard Detection in Combinational and Sequential Switching Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of prime implicants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact algorithms for maximum independent set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of \(k\)-SAT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Which problems have strongly exponential complexity? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4904144 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A logic hazard detection and elimination method / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2020.105980 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:30, 28 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of detecting hazards |
scientific article |
Statements
On the complexity of detecting hazards (English)
0 references
7 October 2020
0 references
computational complexity
0 references
lower bound
0 references
logic hazard
0 references
SETH
0 references