Wormholes, superfast computations, and Selivanov's theorem
From MaRDI portal
Publication:6561174
Cites work
- scientific article; zbMATH DE number 1595639 (Why is no real title available?)
- scientific article; zbMATH DE number 3871350 (Why is no real title available?)
- scientific article; zbMATH DE number 3900744 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 3621713 (Why is no real title available?)
- scientific article; zbMATH DE number 1266752 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 866044 (Why is no real title available?)
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- Computational complexity and feasibility of data processing and interval computations
- In some curved spaces, one can solve NP-hard problems in polynomial time
- Interval analysis and automatic result verification
- Interval methods for solving nonlinear constraint satisfaction, optimization and similar problems. From inequalities systems to game solutions
- Introduction to Interval Analysis
- Measurement Errors and Uncertainties
- Modern classical physics. Optics, fluids, plasmas, elasticity, relativity, and statistical physics
- Techniques of constructive analysis
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)