Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Gábor Kusper"'
Publikováno v:
Mathematics, Vol 9, Iss 20, p 2597 (2021)
In this paper, we introduce the notion of resolvable networks. A resolvable network is a digraph of subnetworks, where subnetworks may overlap, and the inner structure of subnetworks are not interesting from the viewpoint of the network. There are tw
Externí odkaz:
https://doaj.org/article/e65c93a329e34a08a66445a412caf398
Autor:
Gábor Kusper, Csaba Biró
Publikováno v:
Algorithms, Vol 13, Iss 12, p 321 (2020)
In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also
Externí odkaz:
https://doaj.org/article/5226be7589c447d68b146ef6331c6509
Autor:
Bence Mátyás, Gabriela Bautista, Máté Szarka, Gábor Járvás, Gábor Kusper, István Argay, Alice Fialowski, György Mátyás
Publikováno v:
F1000Research, Vol 5 (2017)
Databases which store and manage long-term scientific information related to life science are used to store huge amount of quantitative attributes. Introduction of a new entity attribute requires modification of the existing data tables and the progr
Externí odkaz:
https://doaj.org/article/012efdecd9c74c2da77b3b95c943957c
Publikováno v:
CICM 2022-15th Conference on Intelligent Computer Mathematics
CICM 2022-15th Conference on Intelligent Computer Mathematics, Sep 2022, Tbilisi / Hybrid, Georgia. pp.287-304, ⟨10.1007/978-3-031-16681-5_20⟩
Lecture Notes in Computer Science ISBN: 9783031166808
CICM 2022-15th Conference on Intelligent Computer Mathematics, Sep 2022, Tbilisi / Hybrid, Georgia. pp.287-304, ⟨10.1007/978-3-031-16681-5_20⟩
Lecture Notes in Computer Science ISBN: 9783031166808
International audience; The European Erasmus+ project ARC-Automated Reasoning in the Class aims at improving the academic education in disciplines related to Computational Logic by using Automated Reasoning tools. We present the technical aspects of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2251c0503096ddd6085a8e000893de51
https://inria.hal.science/hal-03781994/file/paper.pdf
https://inria.hal.science/hal-03781994/file/paper.pdf
Publikováno v:
Mathematics
Volume 9
Issue 20
Mathematics, Vol 9, Iss 2597, p 2597 (2021)
Volume 9
Issue 20
Mathematics, Vol 9, Iss 2597, p 2597 (2021)
In this paper, we introduce the notion of resolvable networks. A resolvable network is a digraph of subnetworks, where subnetworks may overlap, and the inner structure of subnetworks are not interesting from the viewpoint of the network. There are tw
Publikováno v:
Production Systems and Information Engineering. 8:19-37
Publikováno v:
Annales Mathematicae et Informaticae.
Publikováno v:
2020 11th IEEE International Conference on Cognitive Infocommunications (CogInfoCom).
Several groups work on automated design pattern recognition or automated refactoring. The goal of our paper is to present examples for ugly program code and its transformation into a pretty version. These examples are useful to test and teach their s
Publikováno v:
SYNASC
We present a model generator which generates SAT problems from digraphs. There are a few restrictions on the input digraphs. There must be no self-loops, and its vertices must be Boolean variables or labeled by distinct Boolean variables. We call suc
Publikováno v:
SACI
In our previous works we introduced several 2-SAT (Strong Model) and 3-SAT (Weak Model, Balatonboglar Model and Simplified Balatonboglar Model) models of directed graphs. We showed that Balatonboglar Model is a Black-and-White 3-SAT problem if and on