Combinatorics, Complexity, & Logic: Proceedings of DMTCS '96
Douglas S. Bridges
Springer, 1997 - Mathematics - 422 pages
DMTCS'96 is the first of a planned series of conferences organized by the Centre for Discrete Mathematics and Theoretical Computer Science, and is the first joint venture of the Computer Science and Mathematics departments of the University of Auckland and Waikato, New Zealand. These proceedings contain original papers which had been solicited in all areas of discrete mathematics and theoretical computer science, in particular in the areas of combinatorics, complexity, computability, constructivity, and logic.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Andrzej Ehrenfeucht and Grzegorz Rozenberj
30 other sections not shown
algebra algorithm assume axioms binary bits bounded Cauchy Cauchy sequence characterization complete computability structure computable function computable isomorphism Computer Science consider constraint satisfaction construction contains context-free corresponding critical sets database decomposition defined Definition denote distance-hereditary graphs domain edge EDTOL effectively continuous ej(A elements embedding example exists finite formula functor given grammars graph G Hence induced infinite input isomorphic lambda calculus language latin squares Lemma Linear Logic LISP Math Mathematics matroids metric space node normal factor notation obtain operations orthogonal output pair parameter parameterized complexity partial field path polynomial positive integers problem proof nets proof structure properties Proposition prove quantum query real numbers recursive function recursively separable regular language representation result Room square S-expression satisfies secret sharing semantics semigroup subset Theorem theory topology tree tuples Turing machine Type variables vertex vertex transitive vertices