Zobrazeno 1 - 7
of 7
pro vyhledávání: '"E. Ya. Dantsin"'
Autor:
Yu. V. Matiyasevich, G E Mints, Maxim Vsemirnov, E F Karavaev, G. V. Davydov, R Pliuškevičius, S V Solov'ev, A O Slisenko, D Yu Grigor'ev, V P Chernov, I D Zaslavskii, E. Ya. Dantsin, N K Kossovskii, V A Lifschitz, M Margenstern, B Yu Konev, Edward A. Hirsch, V P Orevkov
Publikováno v:
Russian Mathematical Surveys. 68:763-767
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26d2f38e65a95ec6e638edf3a072bbbb
https://doi.org/10.1070/rm2013v068n04abeh004852
https://doi.org/10.1070/rm2013v068n04abeh004852
Publikováno v:
Journal of Mathematical Sciences. 118:4948-4962
We survey recent algorithms for the propositional satisfiability problem. In particular, we consider algorithms having the best current worst-case upper bounds on their complexity. We also discuss some related issues: a derandomization of the algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc1e9ba6ed451f1d408fedf58f627d58
https://doi.org/10.1023/a:1025645221773
https://doi.org/10.1023/a:1025645221773
Autor:
E. Ya. Dantsin
Publikováno v:
Journal of Mathematical Sciences. 87:3209-3220
A randomized proof system for arithmetic is introduced. A proof of an arithmetical formula is defined as its derivation from the axioms of arithmetic by the standard rules of inference of arithmetic and also one more rule which we call the random sub
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef52d9c73742bb27e7885fb0a43e0081
https://doi.org/10.1007/bf02358994
https://doi.org/10.1007/bf02358994
Autor:
E. Ya. Dantsin
Publikováno v:
Problems of Reducing the Exhaustive Search. :5-22
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cc085eb5bf19264ed683482eaef3ca3
https://doi.org/10.1090/trans2/178/02
https://doi.org/10.1090/trans2/178/02
Autor:
E. Ya. Dantsin
Publikováno v:
COLOG-88 ISBN: 9783540523352
Conference on Computer Logic
Conference on Computer Logic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a453f4d10c9508c598c84b678b7771d8
https://doi.org/10.1007/3-540-52335-9_48
https://doi.org/10.1007/3-540-52335-9_48
Autor:
E. Ya. Dantsin
Publikováno v:
Journal of Soviet Mathematics. 14:1457-1463
A constructive analytic function f is defined as a pair of form (A,Ω), where. A is a fundamental sequence in some constructive metric space and Ω is a regulator of its convergence into itself. The pointwise-defined function f corresponding to funct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7de5e3982d51d851fccc0fa4dc0ed2c
https://doi.org/10.1007/bf01693977
https://doi.org/10.1007/bf01693977
Autor:
E. Ya. Dantsin
Publikováno v:
Journal of Soviet Mathematics. 22:1293-1305
We consider two calculi in which all propositional tautologies, and only these, are provable. Despite their simple structure (each calculus has one axiom and one rule of inference), we may obtain linear estimates for the length of deduction in them f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::160282c47969c3db6ec686609b42fc61
https://doi.org/10.1007/bf01084392
https://doi.org/10.1007/bf01084392