Ref.No: | 65228300 |
Start date: | 29.01.2021 |
End date: | 28.01.2023 |
Approval date: | 29.01.2021 |
Department: | ELECTRICAL & COMPUTER ENGINEERING |
Sector: | COMPUTER SCIENCE |
Financier: | ΒΑΣΙΚΗ ΕΡΕΥΝΑ, EIDIKOS LOG/MOS EMP |
Budget: | 15.000,00 € |
Public key: | 90Α346ΨΖΣ4-6ΓΗ |
Scientific Responsible: | Lecturer ARISTEIDIS PAGOURTZIS |
Email: | pagour@cs.ntua.gr |
Description: | THE PROJECT CONCERNS THE STUDY OF COUNTING PROBLEMS AND THEIR COMPLEXITY USING TOOLS AND METHODS FROM STRUCTURAL, DESCRIPTIVE, AND PARAMETERIZED COMPLEXITY THEORY. WE SET FOUR MAJOR GOALS REGARDING COUNTING PROBLEMS IN THE CLASS #P, I.E. COUNTING VERSIO |