Amazon cover image
Image from Amazon.com

Logic and machines : decision problems and complexity : Proceedings of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983 at the Institut für Mathematische Logik und Frundlagenforschung der Universität Münster/Westfalen / edited by E. Börger, G. Hasenjaeger, and D. Rödding.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 171.Publication details: Berlin ; New York : Springer-Verlag, 1984.Description: 1 online resource (vi, 456 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540388562
  • 3540388567
Subject(s): Genre/Form: Additional physical formats: Print version:: Logic and machines.DDC classification:
  • 511 19
LOC classification:
  • QA267 .S98 1983
Other classification:
  • 31.80
  • 54.10
  • SS 4800
  • 28
  • DAT 500f
  • MAT 030f
Online resources:
Contents:
P-mitotic sets -- Equivalence relations, invariants, and normal forms, II -- Recurrence relations for the number of labeled structures on a finite set -- Recursively enumerable extensions of R1 by finite functions -- On the complement of one complexity class in another -- The length-problem -- On r.e. inseparability of CPO index sets -- Arithmetical degrees of index sets for complexity classes -- Rudimentary relations and Turing machines with linear alternation -- A critical-pair/completion algorithm for finitely generated ideals in rings -- Extensible algorithms -- Some reordering properties for inequality proof trees -- Modular decomposition of automata -- Modular machines, undecidability and incompleteness -- Universal Turing machines (UTM) and Jones-Matiyasevich-masking -- Complexity of loop-problems in normed networks -- On the solvability of the extended?????? -- Ackermann class with identity -- Reductions for the satisfiability with a simple interpretation of the predicate variable -- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems) -- Implicit definability of finite binary trees by sets of equations -- Spektralproblem and completeness of logical decision problems -- Reduction to NP-complete problems by interpretations -- Universal quantifiers and time complexity of random access machines -- Second order spectra -- On the argument complexity of multiply transitive Boolean functions -- The VLSI complexity of Boolean functions -- Fast parallel algorithms for finding all prime implicants for discrete functions -- Bounds for Hodes -- Specker theorem -- Proving lower bounds on the monotone complexity of Boolean functions.
Action note:
  • digitized 2010 HathiTrust Digital Library committed to preserve
 In: Lecture notes in computer science no:171
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

Print version record.

P-mitotic sets -- Equivalence relations, invariants, and normal forms, II -- Recurrence relations for the number of labeled structures on a finite set -- Recursively enumerable extensions of R1 by finite functions -- On the complement of one complexity class in another -- The length-problem -- On r.e. inseparability of CPO index sets -- Arithmetical degrees of index sets for complexity classes -- Rudimentary relations and Turing machines with linear alternation -- A critical-pair/completion algorithm for finitely generated ideals in rings -- Extensible algorithms -- Some reordering properties for inequality proof trees -- Modular decomposition of automata -- Modular machines, undecidability and incompleteness -- Universal Turing machines (UTM) and Jones-Matiyasevich-masking -- Complexity of loop-problems in normed networks -- On the solvability of the extended?????? -- Ackermann class with identity -- Reductions for the satisfiability with a simple interpretation of the predicate variable -- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems) -- Implicit definability of finite binary trees by sets of equations -- Spektralproblem and completeness of logical decision problems -- Reduction to NP-complete problems by interpretations -- Universal quantifiers and time complexity of random access machines -- Second order spectra -- On the argument complexity of multiply transitive Boolean functions -- The VLSI complexity of Boolean functions -- Fast parallel algorithms for finding all prime implicants for discrete functions -- Bounds for Hodes -- Specker theorem -- Proving lower bounds on the monotone complexity of Boolean functions.

Powered by Koha