Počet záznamů: 1  

Satisfiability of Systems of Equations of Real Analytic Functions is Quasi-decidable

  1. 1.
    Franek, Peter - Ratschan, Stefan - Zgliczynski, P.
    Satisfiability of Systems of Equations of Real Analytic Functions is Quasi-decidable.
    Mathematical Foundations of Computer Science 2011. Berlin: Springer, 2011 - (Murlak, F.; Sankowski, P.), s. 315-326. Lecture Notes in Computer Science, 6907. ISBN 978-3-642-22992-3. ISSN 0302-9743.
    [MFCS 2011. International Symposium /36./. Warsaw (PL), 22.08.2011-26.08.2011]
    http://hdl.handle.net/11104/0202562

    Citováno: 5

    --- CADEK, M. - KRCAL, M. - MATOUSEK, J. - SERGERAERT, F. - VOKRINEK, L. - WAGNER, U. Computing All Maps into a Sphere. JOURNAL OF THE ACM. ISSN 0004-5411, MAY 2014, vol. 61, no. 3. [WOS]
    --- KRCAL, M. - MATOUSEK, J. - SERGERAERT, F. Polynomial-Time Homology for Simplicial Eilenberg-MacLane Spaces. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS. ISSN 1615-3375, DEC 2013, vol. 13, no. 6, p. 935-963. [WOS]
    --- GAO, S.C. - AVIGAD, J. - CLARKE, E.M. Delta-Decidability over the Reals. 2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS). ISSN 1043-6871, 2012, p. 305-314. [WOS]
    --- BORTOLUSSI, L. - HILLSTON, J. Fluid Model Checking. CONCUR 2012 - CONCURRENCY THEORY. ISSN 0302-9743, 2012, vol. 7454, p. 333-347. [WOS]
    --- BORTOLUSSI, L. - HILLSTON, J. Model checking single agent behaviours by fluid approximation. INFORMATION AND COMPUTATION. ISSN 0890-5401, JUN 2015, vol. 242, p. 183-226. [WOS]
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.