YES(?,O(n^2))
42.59/19.62	YES(?,O(n^2))
42.59/19.62	
42.59/19.62	Problem:
42.59/19.62	 h(f(x),y) -> f(g(x,y))
42.59/19.62	 g(x,y) -> h(x,y)
42.59/19.62	
42.59/19.62	Proof:
42.59/19.62	 Complexity Transformation Processor:
42.59/19.62	  strict:
42.59/19.62	   h(f(x),y) -> f(g(x,y))
42.59/19.62	   g(x,y) -> h(x,y)
42.59/19.62	  weak:
42.59/19.62	   
42.59/19.62	  Matrix Interpretation Processor: dim=1
42.59/19.62	   
42.59/19.62	   max_matrix:
42.59/19.62	    1
42.59/19.62	   interpretation:
42.59/19.62	    [g](x0, x1) = x0 + x1 + 225,
42.59/19.62	    
42.59/19.62	    [h](x0, x1) = x0 + x1 + 192,
42.59/19.62	    
42.59/19.62	    [f](x0) = x0 + 64
42.59/19.62	   orientation:
42.59/19.62	    h(f(x),y) = x + y + 256 >= x + y + 289 = f(g(x,y))
42.59/19.62	    
42.59/19.62	    g(x,y) = x + y + 225 >= x + y + 192 = h(x,y)
42.59/19.62	   problem:
42.59/19.62	    strict:
42.59/19.62	     h(f(x),y) -> f(g(x,y))
42.59/19.62	    weak:
42.59/19.62	     g(x,y) -> h(x,y)
42.59/19.62	   Matrix Interpretation Processor: dim=2
42.59/19.62	    
42.59/19.62	    max_matrix:
42.59/19.62	     [1 1]
42.59/19.62	     [0 1]
42.59/19.62	    interpretation:
42.59/19.62	                   [1 1]          [1]
42.59/19.62	     [g](x0, x1) = [0 1]x0 + x1 + [0],
42.59/19.62	     
42.59/19.62	                   [1 1]          [1]
42.59/19.62	     [h](x0, x1) = [0 1]x0 + x1 + [0],
42.59/19.62	     
42.59/19.62	                    [1]
42.59/19.62	     [f](x0) = x0 + [1]
42.59/19.62	    orientation:
42.59/19.62	                 [1 1]        [3]    [1 1]        [2]            
42.59/19.62	     h(f(x),y) = [0 1]x + y + [1] >= [0 1]x + y + [1] = f(g(x,y))
42.59/19.62	     
42.59/19.62	              [1 1]        [1]    [1 1]        [1]         
42.59/19.62	     g(x,y) = [0 1]x + y + [0] >= [0 1]x + y + [0] = h(x,y)
42.59/19.62	    problem:
42.59/19.62	     strict:
42.59/19.62	      
42.59/19.62	     weak:
42.59/19.62	      h(f(x),y) -> f(g(x,y))
42.59/19.62	      g(x,y) -> h(x,y)
42.59/19.62	    Qed
42.59/19.63	EOF