Narrow your search
Listing 1 - 10 of 13 << page
of 2
>>
Sort by
The monadic second order theory of all countable ordinals. 2
Authors: --- ---
ISBN: 3540063455 0387063455 354046946X 9783540063452 Year: 1973 Volume: 2 328 Publisher: Berlin : Springer-Verlag,

Principles of computer hardware.
Author:
ISBN: 9780199273133 0199273138 Year: 2006 Publisher: Oxford Oxford university press


Periodical
Business & information systems engineering
ISSN: 18670202 Year: 2009 Publisher: Wiesbaden

Loading...
Export citation

Choose an application

Bookmark

Abstract

The journal's objective is to cement its competitive position as a prominent journal of the BISE (Business & Information Systems Engineering) community and reinforce that status through quality improvements and extending its readership. In addition, the journal seeks to establish design science oriented research within the global arena, secure a lasting position and reputation in the global BISE community, and foster constructive dialogue among the discipline's differing international models. Therefore, the journal aims at further developing the theoretical foundations of action in order to preserve sustainable approaches despite tempestuous technical development. Besides, the journal aspires to promote technology transfer in order to make better solutions available faster and to considerably reduce costs of system design and operation. The central mission is to develop, promote, and shape the BISE discipline for the benefit of its members and society.

Introduction to circuit complexity : a uniform approach
Author:
ISBN: 3540643109 3642083986 3662039273 Year: 1999 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study. It begins with efficient Boolean circuits for problems with high practical relevance, e.g., arithmetic operations, sorting, and transitive closure, then compares the computational model of Boolean circuits with other models such as Turing machines and parallel machines. Examination of the complexity of specific problems leads to the definition of complexity classes. The theory of circuit complexity classes is then thoroughly developed, including the theory of lower bounds and advanced topics such as connections to algebraic structures and to finite model theory.

Keywords

Computer science --- Algebra, Boolean. --- Computational complexity. --- Electronic digital computers --- Logic, Symbolic and mathematical. --- Circuits --- Design. --- Computers. --- Algorithms. --- Mathematical logic. --- Computer mathematics. --- Electronics. --- Microelectronics. --- Theory of Computation. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Mathematical Logic and Formal Languages. --- Computational Mathematics and Numerical Analysis. --- Electronics and Microelectronics, Instrumentation. --- Microminiature electronic equipment --- Microminiaturization (Electronics) --- Electronics --- Microtechnology --- Semiconductors --- Miniature electronic equipment --- Electrical engineering --- Physical sciences --- Computer mathematics --- Electronic data processing --- Mathematics --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Foundations --- Automatic digital computers --- Computers, Electronic digital --- Digital computers, Electronic --- Computers --- Hybrid computers --- Sequential machine theory

Listing 1 - 10 of 13 << page
of 2
>>
Sort by