Logic and Machines: Decision Problems and Complexity [electronic resource] : Proceedings of the Symposium “Rekursive Kombinatorik” held from May 23 – 28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen / edited by E. Börger, G. Hasenjaeger, D. Rödding.

By: Börger, E [editor.]Contributor(s): Hasenjaeger, G [editor.] | Rödding, D [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 171Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1984Description: VI, 460 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540388562Subject(s): Computer science | Logic, Symbolic and mathematical | Computer Science | Computation by Abstract Devices | Mathematical Logic and Formal Languages | Mathematical Logic and FoundationsAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this 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.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha