Projects funded by the NCN
Algorithms concerning the legibility of natural deduction proofs
2012/07/N/ST6/02147
Keywords:
Operations on languages Legibility of proofs Acyclic partition digraph Linear arrangement NP-complete probleb
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet w Białymstoku, Wydział Matematyki i Informatyki
woj. podlaskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: PRELUDIUM 4 - announced on 2012-09-15
Amount awarded: 98 340 PLN
Project start date (Y-m-d): 2013-07-08
Project end date (Y-m-d): 2017-01-07
Project duration:: 42 months (the same as in the proposal)
Project status: Project settled