Fulla Peter

フラペテル | Fulla Peter

所属機関・部署：
職名：助教C

研究分野 (1件)：数理情報学

論文 (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

講演・口頭発表等 (4件)：

計算複雑性の入門
(東京学芸大国際中等教育学校での模擬講義 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)

学歴 (3件)：

学位 (2件)：

経歴 (6件)：

全件表示

※　J-GLOBALの研究者情報は、researchmapの登録情報に基づき表示しています。登録・更新については、こちらをご覧ください。