Fulla Peter

フラペテル | Fulla Peter

Affiliation and department：
Job title： Research Associate

Research field (1)： Mathematical informatics

Papers (7)：

Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat. Inequity aversion pricing over social networks: Approximation algorithms and hardness results. Theoretical Computer Science. 2021. 871. 62-78
P. Fulla, H. Uppman, S. Živný. The Complexity of Boolean Surjective General-Valued CSPs. Transactions on Computation Theory. 2018. 11. 1. 4:1-4:31
P. Fulla, S. Živný. On Planar Valued CSPs. Journal of Computer and System Sciences. 2017. 87. 104-118
P. Fulla, S. Živný. The Complexity of Boolean Surjective General-Valued CSPs. 42nd International Symposium on Mathematical Foundations of Computer Science. 2017. 4:1-4:14
P. Fulla, S. Živný. A Galois Connection for Weighted (Relational) Clones of Infinite Size. Transactions on Computation Theory. 2016. 8. 3. 9:1-9:21

ｍore...

Lectures and oral presentations (4)：

Computational complexity: Some problems are harder than others (and that may be a good thing)
(2022)
The Complexity of Boolean Surjective General-Valued CSPs
(42nd International Symposium on Mathematical Foundations of Computer Science 2017)
On Planar Valued CSPs
(41st International Symposium on Mathematical Foundations of Computer Science 2016)
A Galois Connection for Valued Constraint Languages of Infinite Size
(Automata, Languages, and Programming - 42nd International Colloquium 2015)

Education (3)：

Professional career (2)：

Work history (6)：

Show all

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page