Wormholes, superfast computations, and Selivanov's theorem

DOI10.1134/S1055134424020020MaRDI QIDQ6561174FDOQ6561174

Authors: Olga Kosheleva, Vladik Kreinovich 

Publication date: 24 June 2024

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

metricwormholesconstructive mathematicsinterval uncertaintysuperfast computations

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Error analysis and interval analysis (65Gxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to Interval Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Techniques of constructive analysis
• Computational complexity and feasibility of data processing and interval computations
• Interval analysis and automatic result verification
• Measurement Errors and Uncertainties
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• In some curved spaces, one can solve NP-hard problems in polynomial time
• Modern classical physics. Optics, fluids, plasmas, elasticity, relativity, and statistical physics
• Interval methods for solving nonlinear constraint satisfaction, optimization and similar problems. From inequalities systems to game solutions

This page was built for publication: Wormholes, superfast computations, and Selivanov's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561174)