Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Adrian Crăciun"'
Autor:
Georgiana Şurlea, Adrian Crăciun
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 61-75 (2019)
In this paper, we make a contribution to the computation of Gröbner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we investigate
Externí odkaz:
https://doaj.org/article/73c1d0c3c4fd4ffa90bd410a26c140b7
Autor:
Adrian Crăciun, Georgiana Surlea
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 61-75 (2019)
FROM
FROM
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we investigate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6aa085def3a732b58e3037c3ef148397
https://doaj.org/article/73c1d0c3c4fd4ffa90bd410a26c140b7
https://doaj.org/article/73c1d0c3c4fd4ffa90bd410a26c140b7
Publikováno v:
Review of the Air Force Academy. 16:55-64
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39bc163e8ec130efdc209ff0e320ee45
https://doi.org/10.19062/1842-9238.2018.16.1.8
https://doi.org/10.19062/1842-9238.2018.16.1.8
Autor:
Mircea Marin, Adrian Crăciun
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 303:1-2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b0a1784cbf144d29b0753c6a2def3be
https://doi.org/10.4204/eptcs.303.0
https://doi.org/10.4204/eptcs.303.0
Autor:
Florentin Adrian Crăciun
Publikováno v:
Review of Ecumenical Studies Sibiu. 6:49-72
In the last century both Orthodox and Catholic theologians have improved their reflection on the Eucharistic sacrifice in a critical manner in regard to the Latin medieval or scholastic theology. They have also developed their thinking in a theologic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e269eeed76375a05c0cd44a6e9247fa
https://doi.org/10.2478/ress-2014-0104
https://doi.org/10.2478/ress-2014-0104
Publikováno v:
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 17:v-viii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fccb3bab3edf23be832084077b453c0
https://doi.org/10.1142/s0218488509005991
https://doi.org/10.1142/s0218488509005991
Publikováno v:
Automata, Languages, and Programming ISBN: 9783662476659
ICALP (2)
ICALP (2)
We prove that the propositional translations of the Kneser-Lovasz theorem have polynomial size extended Frege proofs and quasi-polynomial size Frege proofs. We present a new counting-based combinatorial proof of the Kneser-Lovasz theorem that avoids
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10bda735edbba303b38f16f1e87b56b1
https://doi.org/10.1007/978-3-662-47666-6_4
https://doi.org/10.1007/978-3-662-47666-6_4
Autor:
Bruno Buchberger, Adrian Crăciun
Publikováno v:
Electronic Notes in Theoretical Computer Science. 93:24-59
Recently, we proposed a systematic method for top-down synthesis and verification of lemmata and algorithms called “lazy thinking method” as a part of systematic mathematical theory exploration (mathematical knowledge management). The lazy thinki
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00901dffc264451e335709f24ee52f5f
https://doi.org/10.1016/j.entcs.2003.12.027
https://doi.org/10.1016/j.entcs.2003.12.027
Autor:
Adrian Crăciun, Gabriel Istrate
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319092836
SAT
SAT
We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the Kneser-Lovasz Theorem. This is a family of propositional tautologies, indexed by an nonnegative integer parameter k that genera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86c999b0d7000d8da70c85a8964f9509
https://doi.org/10.1007/978-3-319-09284-3_11
https://doi.org/10.1007/978-3-319-09284-3_11
Autor:
Adrian Crăciun, Mircea Marin
Publikováno v:
SYNASC
An important feature of statically typed XML programming languages is the type inference of variables in regular expression patterns, when matching is performed on input of a known type. At least, such an algorithm must be be simple, local, and local
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::050e26a6aaac2a07ae934cdeb7bb1571
https://doi.org/10.1109/synasc.2010.20
https://doi.org/10.1109/synasc.2010.20