Foundations of Computer Science, Volume 1 |
Contents
Introduction | 1 |
Winograds Algorithm for Matrix Product | 2 |
A Recursive Method Recurrence Relations | 3 |
9 other sections not shown
Other editions - View all
Common terms and phrases
a₁ a₂ abstract access function algL alpha expression applied Assume attributes axiomatic axioms BAKKER basic binary relational candidate key cartesian product computation concepts data base models data values datalogical defined definition denote desk domain E.F. CODD E.J. NEUHOLD elements employee equivalent example execution exists f₁ FIFO finite first-order formal description formula functional dependence given inductive assertion method infological model information system input integer language least fixed point lemma logic mapping matrix product monotonicity multiplication normal form notation operating system P₁ P₂ pair PASIC programs path predicate predicate logic primary key problem Proc proof properties prove recursive recursive procedures relational algebra relational calculus relational model result rule satisfy Scott's induction selectors semantic sequence simple specified statement Strassen's algorithm structure subject matter models T₁ T₂ theorem theory tion transitive closure tuple variables vector Winograd's