Zobrazeno 1 - 10
of 19
pro vyhledávání: '"László Egri"'
Publikováno v:
Magyar Traumatológia Ortopédia Kézsebészet Plasztikai Sebészet. 60:97-111
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edaf7f92feaa1b318d36fb6374772969
https://doi.org/10.21755/mto.2017.060.0304.003
https://doi.org/10.21755/mto.2017.060.0304.003
Autor:
Suprovat Ghoshal, László Egri, Bingkai Lin, Édouard Bonnet, Pasin Manurangsi, C S Karthik, Arnab Bhattacharyya, Dániel Marx
The $k$-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over $\mathbb F_2$, which can be stated as follows: given a generator matrix $\mathbf A$ and an integer $k$, determine whether the code generated by $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b076090e46d0f9202c81ed72ba42bbc2
Publikováno v:
Magyar Traumatológia Ortopédia Kézsebészet Plasztikai Sebészet. 59:49-64
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c230c92596db1c6707c3f693dd2a5031
https://doi.org/10.21755/mto.2016.059.0102.006
https://doi.org/10.21755/mto.2016.059.0102.006
Autor:
ANTAL, RENNER1, LÁSZLÓ, EGRI, JÁNOS JR., RUPNIK, ISTVÁN, ZIMMERMANN, GÉZA, HARDY, ANNAMÁRIA, SZENTIRMAI
Publikováno v:
Magyar Traumatológia, Ortopédia, Kézsebészet, Plasztikai Sebészet. 2013, Vol. 56 Issue 1, p53-63. 11p.
Publikováno v:
International Journal of Humanoid Robotics. :245-279
The new field of developmental robotics faces the formidable challenge of implementing effective learning mechanisms in complex, dynamic environments. We make a case that knowledge-based learning algorithms might help to meet this challenge. A constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18f06a265a9e3c39ac43c1dac7618b72
https://doi.org/10.1142/s0219843607001035
https://doi.org/10.1142/s0219843607001035
Publikováno v:
LICS
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A. Bulatov (2003).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::706d32b1b5427a3d00559496c5f3db5b
https://doi.org/10.1109/lics.2015.52
https://doi.org/10.1109/lics.2015.52
Publikováno v:
The Electronic Journal of Combinatorics. 22
We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0d6f6e31e94ac94253594c9cf0a6a05
https://doi.org/10.37236/4419
https://doi.org/10.37236/4419
Autor:
László Egri, Thomas R. Shultz
Constraint satisfaction is the art of finding values for variables in a way that satisfies various constraints. Many everyday problems can be usefully couched in these terms. This survey of constraint-satisfaction models covers both symbolic approach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ff1272c3d79edac13ead6727df1d76f
https://doi.org/10.1016/b978-0-08-097086-8.43023-0
https://doi.org/10.1016/b978-0-08-097086-8.43023-0
Autor:
László Egri
Publikováno v:
Journal of Logic and Computation
Symmetric Datalog, a fragment of the logic programming language Datalog, is conjectured to capture all constraint satisfaction problems (CSP) in L. Therefore developing tools that help us understand whether or not a CSP can be defined in symmetric Da
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbd1ae4c164a2cfa42c15481d7ea19f5
http://arxiv.org/abs/1312.4428
http://arxiv.org/abs/1312.4428
In the deletion version of the list homomorphism problem, we are given graphs G and H, a list $$L(v)\subseteq V(H)$$L(v)⊆V(H) for each vertex $$v\in V(G)$$vźV(G), and an integer k. The task is to decide whether there exists a set $$W \subseteq V(G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c50164ac4f563960118b50fe5d549b6e
http://arxiv.org/abs/1308.1068
http://arxiv.org/abs/1308.1068