What people are saying - Write a review
We haven't found any reviews in the usual places.
Logic and the Challenge of Computer Science Yuri Gurevich
Complexity Relations Between Programs
Polynomial Time Degrees of NPSets Klaus AmbosSpies
6 other sections not shown
algorithm analysis assignment asymptotic BCNF binary Boolean Börger bounded resources clause combinatorial complexity classes component Computer Science configuration construction Corollary corresponding database schema decision problem defined definition denoted dependencies deterministic diagonalization diagonalization lemma disjoint disjoint parallel distributed dynamic structures elements emvd's equivalent example exponential exponential generating functions fa’s finite first-order logic given global function global relation graph Horn formulae implication problem input integer isomorphic labelled lemma Math Mellin transform messages multivalued dependencies mvd's natural numbers nodes nondeterministic notion NP-complete p-r-degrees parallel programs partial ordering Pascal permutations polynomial polynomially honest predicate primitive recursive Proc processors PROLOG proof outlines proof system properties propositional propositional logic prove random recursive sets reduced respectively rule satisfies Section semantics sequence strings subset superkey symbol terminate theory total correctness transitive closure tree tuple Turing machine universal variables