×

Found 75 Documents (Results 1–75)

Computer science for continuous data. Survey, vision, theory, and practice of a computer analysis system. (English) Zbl 1514.68322

Boulier, François (ed.) et al., Computer algebra in scientific computing. 24th international workshop, CASC 2022, Gebze, Turkey, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13366, 62-82 (2022).
MSC:  68W30
PDFBibTeX XMLCite
Full Text: DOI

Exact real computation of solution operators for linear analytic systems of partial differential equations. (English) Zbl 07497965

Boulier, François (ed.) et al., Computer algebra in scientific computing. 23rd international workshop, CASC 2021, Sochi, Russia, September 13–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12865, 370-390 (2021).
MSC:  68W30
PDFBibTeX XMLCite
Full Text: DOI

Bit-complexity of solving systems of linear evolutionary partial differential equations. (English) Zbl 07493533

Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 223-241 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Computing Haar measures. (English) Zbl 07650847

Fernández, Maribel (ed.) et al., 28th EACSL annual conference on computer science logic, CSL 2020, Barcelona, Spain, January 13–16, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 152, Article 34, 17 p. (2020).
MSC:  68-XX 03B70
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantitative coding and complexity theory of compact metric spaces. (English) Zbl 07633509

Anselmo, Marcella (ed.) et al., Beyond the horizon of computability. 16th conference on computability in Europe, CiE 2020, Fisciano, Italy, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12098, 205-214 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Computational complexity of real powering and improved solving linear differential equations. (English) Zbl 07121069

van Bevern, René (ed.) et al., Computer science – theory and applications. 14th international computer science symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11532, 215-227 (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Average-case polynomial-time computability of Hamiltonian dynamics. (English) Zbl 1512.03059

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 30, 17 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Computable Operations on Compact Subsets of Metric Spaces with Applications to Fréchet Distance and Shape Optimization. arXiv:1701.08402

Preprint, arXiv:1701.08402 [cs.LO] (2017).
MSC:  03D78 68Q99 65J99
BibTeX Cite
Full Text: arXiv

Complexity theory of (functions on) compact metric spaces. (English) Zbl 1401.03086

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 837-846 (2016).
MSC:  03D78 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Towards computational complexity theory on advanced function spaces in analysis. (English) Zbl 1476.03066

Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 142-152 (2016).
MSC:  03D78 03D15
PDFBibTeX XMLCite
Full Text: DOI

Average-case bit-complexity theory of real functions. (English) Zbl 1460.03016

Kotsireas, Ilias S. (ed.) et al., Mathematical aspects of computer and information sciences. 6th international conference, MACIS 2015, Berlin, Germany, November 11–13, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9582, 505-519 (2016).
MSC:  03D78 03D15
PDFBibTeX XMLCite
Full Text: DOI

On the computational complexity of positive linear functionals on \(\mathcal{C}[0;1]\). (English) Zbl 1460.03015

Kotsireas, Ilias S. (ed.) et al., Mathematical aspects of computer and information sciences. 6th international conference, MACIS 2015, Berlin, Germany, November 11–13, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9582, 489-504 (2016).
MSC:  03D78 68Q25 03D15
PDFBibTeX XMLCite
Full Text: DOI

From calculus to algorithms without errors. (English) Zbl 1402.65039

Hong, Hoon (ed.) et al., Mathematical software – ICMS 2014. 4th international congress, Seoul, South Korea, August 5–9, 2014. Proceedings. Berlin: Springer (ISBN 978-3-662-44198-5/pbk). Lecture Notes in Computer Science 8592, 718-724 (2014).
MSC:  65Gxx 68W30
PDFBibTeX XMLCite
Full Text: DOI

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines. (English) Zbl 1462.68042

Neary, Turlough (ed.) et al., Proceedings of the conference on machines, computations and universality 2013, MCU 2013, Zürich, Switzerland, September 9–11, 2013. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 128, 85-92 (2013).
MSC:  68Q09 03D78 68Q15
PDFBibTeX XMLCite
Full Text: arXiv Link

Real benefit of promises and advice. (English) Zbl 1315.03066

Bonizzoni, Paola (ed.) et al., The nature of computation. Logic, algorithms, applications. 9th conference on computability in Europe, CiE 2013, Milan, Italy, July 1–5, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39052-4/pbk). Lecture Notes in Computer Science 7921, 1-11 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Computational complexity of smooth differential equations. (English) Zbl 1326.68151

Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27–31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 578-589 (2012).
MSC:  68Q17 03D78 34A12
PDFBibTeX XMLCite
Full Text: DOI arXiv

Real analytic machines and degrees. (English) Zbl 1456.03067

Zheng, Xizhong (ed.) et al., Seventh international conference on computability and complexity in analysis, Zhenjiang, China, June 21–25, 2010. Proceedings. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 24, 77-91 (2010).
MSC:  03D78 03D10
PDFBibTeX XMLCite
Full Text: Link

Real computation with least discrete advice: a complexity theory of nonuniform computability. (English) Zbl 1247.03106

Bauer, Andrej (ed.) et al., 6th international conference on computability and complexity in analysis (CCA’09). Proceedings of the international conference, August 18–22, 2009, Ljubljana, Slovenia. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-12-5). OASIcs – OpenAccess Series in Informatics 11, 12 p., electronic only (2009).
MSC:  03D78 65F99 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Singular coverings and non-uniform notions of closed set computability. (English) Zbl 1262.03085

Dilhage, R. (ed.) et al., Proceedings of the fourth international conference on computability and complexity in analysis (CCA 2007), Siena, Italy, June 16–18, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 202, 73-88 (2008).
MSC:  03D78 68Q05
PDFBibTeX XMLCite
Full Text: DOI

Kolmogorov complexity theory over the reals. (English) Zbl 1262.68057

Brattka, V. (ed.) et al., Proceedings of the fifth international conference on computability and complexity in analysis (CCA 2008), Hagen, Germany, August 21–24, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 221, 153-169 (2008).
MSC:  68Q30 03D78 68Q05
PDFBibTeX XMLCite
Full Text: DOI

On faster integer calculations using non-arithmetic primitives. (English) Zbl 1166.68322

Calude, Cristian S. (ed.) et al., Unconventional computation. 7th international conference, UC 2008, Vienna, Austria, August 25–28, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85193-6/pbk). Lecture Notes in Computer Science 5204, 111-128 (2008).
MSC:  68Q05 68Q10 68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Revising type-2 computation and degrees of discontinuity. (English) Zbl 1262.03150

Cenzer, D. (ed.) et al., Proceedings of the 3rd international conference on computability and complexity in analysis (CCA 2006), Gainesville, FL, USA, November 1–5, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 167, 255-274 (2007).
MSC:  03F60 03D78
PDFBibTeX XMLCite
Full Text: DOI arXiv

Real computational universality: the word problem for a class of groups with infinite presentation. (Extended abstract). (English) Zbl 1147.20308

Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 726-737 (2007).
MSC:  20F10 68Q05 03D10 20F05 03D35 03D40
PDFBibTeX XMLCite
Full Text: DOI

(Short) survey of real hypercomputation. (English) Zbl 1151.68414

Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 809-824 (2007).
MSC:  68Q05 68Q10 03D10 03D55
PDFBibTeX XMLCite
Full Text: DOI

Uncomputability below the real halting problem. (English) Zbl 1145.68417

Beckmann, Arnold (ed.) et al., Logical approaches to computational barriers. Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30–July 5, 2006. Proceedings. Berlin: Springer (ISBN 3-540-35466-2/pbk). Lecture Notes in Computer Science 3988, 368-377 (2006).
MSC:  68Q05 03D10 03D35
PDFBibTeX XMLCite
Full Text: DOI

An explicit solution to Post’s problem over the reals. (English) Zbl 1123.03034

Liśkiewicz, Maciej (ed.) et al., Fundamentals of computation theory. 15th international symposium, FCT 2005, Lübeck, Germany, August 17–20, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28193-2/pbk). Lecture Notes in Computer Science 3623, 467-478 (2005).
MSC:  03D10 03B25 68Q05 03D28
PDFBibTeX XMLCite
Full Text: DOI

On approximating real-world halting problems. (English) Zbl 1123.03033

Liśkiewicz, Maciej (ed.) et al., Fundamentals of computation theory. 15th international symposium, FCT 2005, Lübeck, Germany, August 17–20, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28193-2/pbk). Lecture Notes in Computer Science 3623, 454-466 (2005).
MSC:  03D10 03B25 68Q05 68N30
PDFBibTeX XMLCite
Full Text: DOI

Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism. (English) Zbl 1115.03039

Cooper, S. Barry (ed.) et al., New computational paradigms. First conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8–12, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26179-6/pbk). Lecture Notes in Computer Science 3526, 562-571 (2005).
MSC:  03D10 03D55 03F60
PDFBibTeX XMLCite
Full Text: DOI

Spanners, weak spanners, and power spanners for wireless networks. (English) Zbl 1116.68561

Fleischer, Rudolf (ed.) et al., Algorithms and computation. 15th international symposium, ISAAC 2004, Hong Kong, China, December 20–22, 2004. Proceedings. Berlin: Springer (ISBN 3-540-24131-0/pbk). Lecture Notes in Computer Science 3341, 805-821 (2004).
MSC:  68R10 68M10 68U05
PDFBibTeX XMLCite
Full Text: DOI

Fast multipoint evaluation of bivariate polynomials. (English) Zbl 1111.68789

Albers, Susanne (ed.) et al., Algorithms – ESA 2004. 12th annual European symposium, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23025-4/pbk). Lecture Notes in Computer Science 3221, 544-555 (2004).
MSC:  68W30 68Q25
PDFBibTeX XMLCite
Full Text: DOI

New bounds for hypercube slicing numbers. (English) Zbl 1001.68172

Discrete models: combinatorics, computation, and geometry. Proceedings of the 1st international conference (DM-CCG), Paris, France, July 2-5, 2001. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD), Discrete Math. Theor. Comput. Sci., Proc. AA, 155-164, electronic only (2001).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: EMIS

Computing the dimension of linear subspaces. (English) Zbl 1043.03519

Hlaváč, Václav (ed.) et al., SOFSEM 2000: Theory and practice of informatics. 27th conference on current trends in theory and practice of informatics, Milovy, Czech Republic, November 25–December 2, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41348-0). Lect. Notes Comput. Sci. 1963, 450-458 (2000).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

Database

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software