A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139960707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The essence of constraint propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying interval arithmetic to real, integer, and boolean constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine equations, Presburger arithmetic and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Interpretation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster solver for general systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic constraint solving and interval arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Data Flow Analysis and Iterative Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4424848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Linear Inequalities by Computing Loop Residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:47, 11 June 2024

scientific article
Language Label Description Also known as
English
A class of polynomially solvable range constraints for interval analysis without widenings
scientific article

    Statements

    A class of polynomially solvable range constraints for interval analysis without widenings (English)
    0 references
    0 references
    0 references
    6 December 2005
    0 references
    0 references
    Range constraints
    0 references
    Interval analysis
    0 references
    Algorithms
    0 references
    Complexity
    0 references
    0 references