Improving legibility of formal proofs based on the close reference principle is NP-hard (Q286805): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59407604, #quickstatements; #temporary_batch_1710346988437 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10817-015-9337-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1268136390 / rank | |||
Normal rank | |||
Revision as of 20:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving legibility of formal proofs based on the close reference principle is NP-hard |
scientific article |
Statements
Improving legibility of formal proofs based on the close reference principle is NP-hard (English)
0 references
26 May 2016
0 references
natural deduction
0 references
legibility
0 references
NP-completeness
0 references
