Improving legibility of formal proofs based on the close reference principle is NP-hard (Q286805): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 03B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6585261 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
natural deduction | |||
| Property / zbMATH Keywords: natural deduction / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
legibility | |||
| Property / zbMATH Keywords: legibility / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-completeness | |||
| Property / zbMATH Keywords: NP-completeness / rank | |||
Normal rank | |||
Revision as of 18:50, 27 June 2023
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
