Opening book details…
Can I read Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University (DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE) on EtoBox?
Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University (DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE) by Neil Immerman; Phokion G. Kolaitis; Phokion Kolaitis is a computer science book available to read on EtoBox.
What is Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University (DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE) about?
From the Preface: We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational
Who reads Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University (DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE)?
It is typically read by working professionals who need an authoritative practice reference.
Common subject areas: medicine, law, business, engineering.
- Author
- Neil Immerman; Phokion G. Kolaitis; Phokion Kolaitis
- Publisher
- Providence, R.I.: American Mathematical Society
- Published
- 1997
- Language
- EN
- ISBN
- 9780821805176
- Category
- computer science
- Subjects
- Mathematics, Computer Science, Machine Theory
- Updated
- 2026-03-25
More by Neil Immerman; Phokion G. Kolaitis; Phokion Kolaitis
Browse all works by Neil Immerman; Phokion G. Kolaitis; Phokion Kolaitis
Similar books
- Finite Versus Infinite: Contributions to an Eternal Dilemma (Discrete Mathematics and Theoretical Computer Science) — Cristian S. Calude; Gheorghe Paun (2012)
- Dna Based Computers: Proceedings Of A Dimacs Workshop April 4, 1995 Princeton University (dimacs Series In Discrete Mathematics And Theoretical Computer Science) (v. 1) — Richard J Lipton; Eric B Baum; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.; DIMACS (Group) (1996)
- Polynomials: An Algorithmic Approach (Discrete Mathematics and Theoretical Computer Science) — Maurice Mignotte, Doru Ştefănescu (1999)
- Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) — Richard Lassaigne; Michel de Rougemont (2012)
- Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) — Howard Straubing (2012)
- Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science) — Paul W Beame; Samuel R Buss; DIMACS (Group); NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science; DIMACS Workshop on Feasible Arithmetics and Length of Proofs (1997)