EN HU

OTKA-109185

Algebrai módszerek a bonyolultságelméletben
start date: 2013-09-01
end date: 2017-08-31
Uploaded publications:
3
Publications in DEA:
3
OA:
1
Date range:
2018-2019
2019
1.
Bodirsky, M., Martin, B., Pinsker, M., Pongrácz, A.: Constraint Satisfaction Problems for Reducts of Homogeneous Graphs.
SIAM J. Comput. 48 (4), 1224-1264, 2019.
Journal metrics:
D1 Computer Science (miscellaneous)
Q1 Mathematics (miscellaneous)
2018
2.
Földvári, A. J.: The complexity of the equation solvability problem over nilpotent groups.
J. Algebra. 495, 289-303, 2018.
Journal metrics:
Q1 Algebra and Number Theory
3.
Bodirsky, M., Bradley-Williams, D., Pinsker, M., Pongrácz, A.: The universal homogeneous binary tree.
J. Logic Comput. 28 (1), 133-163, 2018.
Journal metrics:
Q2 Arts and Humanities (miscellaneous)
Q2 Hardware and Architecture
Q2 Logic
Q2 Software
Q2 Theoretical Computer Science
DEENK University of Debrecen
© 2012 University of Debrecen