Automating OBDD proofs is NP-hard (Q6584062)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7893097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automating OBDD proofs is NP-hard |
scientific article; zbMATH DE number 7893097 |
Statements
Automating OBDD proofs is NP-hard (English)
0 references
6 August 2024
0 references
proof complexity
0 references
OBDD
0 references
automatability
0 references
lifting
0 references
dag-like communication
0 references
