Nuprl Definition : shadow_inequalities
Find the variable whose maximum coefficient (in any of the constraints) is
the least, and eliminate that variable by computing its
"shadow inequalities". This the the heuristic used by Bill Pugh in the
original version of the omega test.⋅
shadow_inequalities(ineqs) ==
if ineqs = Ax then ineqs otherwise eval i = index-of-min(max_tl_coeffs(ineqs)) + 1 in
shadow-inequalities(i;ineqs)
Definitions occuring in Statement :
max_tl_coeffs: max_tl_coeffs(ineqs),
shadow-inequalities: shadow-inequalities(i;ineqs),
index-of-min: index-of-min(zs),
callbyvalue: callbyvalue,
isaxiom: if z = Ax then a otherwise b,
add: n + m,
natural_number: $n
Definitions occuring in definition :
isaxiom: if z = Ax then a otherwise b,
callbyvalue: callbyvalue,
add: n + m,
index-of-min: index-of-min(zs),
max_tl_coeffs: max_tl_coeffs(ineqs),
natural_number: $n,
shadow-inequalities: shadow-inequalities(i;ineqs)
FDL editor aliases :
shadow_inequalities
Latex:
shadow\_inequalities(ineqs) ==
if ineqs = Ax then ineqs otherwise eval i = index-of-min(max\_tl\_coeffs(ineqs)) + 1 in
shadow-inequalities(i;ineqs)
Date html generated:
2016_07_08-PM-04_48_23
Last ObjectModification:
2015_12_14-PM-07_01_13
Theory : omega
Home
Index