Advertisement

Basics

  • Christoph Meinel
  • Thorsten Theobald

Abstract

Propositional logic. The theme of propositional calculus is to investigate simple logical connections among elementary statements. Such elementary statements are for example
  • “Paris is the capital of France.”

  • “6 is a prime number.”

Keywords

Hash Function Undirected Graph Polynomial Time Algorithm Propositional Calculus Finite State Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The topics of this chapter all belong to the fundamentals of computer science and discrete mathematics, so we cite merely a small collection of relevant textbooks. Detailed information on the topics of discrete mathematics can be found in [Big90]. The design and analysis of algorithms and data structures is covered in [AHU74] and [CLR90]. Introductions to the theory of NP-completeness can be found in [GJ78, Pap94]. In particular, the compendium [GJ78] additionally contains a complexity theoretical classification of many problems, in particular with regard to NP-completeness.Google Scholar
  2. A standard work concerning finite automata is [HU78]. Finally, the books [Mic94] and [HS96] excellently cover algorithmic aspects and the significance of finite state machines in VLSI design.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Christoph Meinel
    • 1
  • Thorsten Theobald
    • 2
  1. 1.University of TrierTrierGermany
  2. 2.Technical University MünchenMünchenGermany

Personalised recommendations