A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems

DOI10.1007/BF02385263zbMath0839.65057OpenAlexW2491373395MaRDI QIDQ1904322

Bonnie Traylor, Vladik Ya. Kreinovich

Publication date: 16 June 1996

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02385263

zbMATH Keywords

heuristicsinterval computationsNP-hardness

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• On the greedy algorithm for satisfiability
• Checking robust nonsingularity is NP-hard
• Counting the number of solutions for instances of satisfiability
• Computation complexity of the range of a polynomial in several variables
• Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
• On Solving Systems of Equations Using Interval Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems