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 /
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.
Main Authors: | , , , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1984
|
Subjects: | Mathematics., Computers., Mathematical logic., Mathematics, general., Computation by Abstract Devices., Mathematical Logic and Formal Languages., Mathematical Logic and Foundations., |
Online Access: | http://dx.doi.org/10.1007/3-540-13331-3 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
KOHA-OAI-TEST:209890 |
---|---|
record_format |
koha |
spelling |
KOHA-OAI-TEST:2098902018-07-30T23:41:57ZLogic 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 / Börger, E. editor. Hasenjaeger, G. editor. Rödding, D. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1984.engP-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.Mathematics.Computers.Mathematical logic.Mathematics.Mathematics, general.Computation by Abstract Devices.Mathematical Logic and Formal Languages.Mathematical Logic and Foundations.Springer eBookshttp://dx.doi.org/10.1007/3-540-13331-3URN:ISBN:9783540388562 |
institution |
COLPOS |
collection |
Koha |
country |
México |
countrycode |
MX |
component |
Bibliográfico |
access |
En linea En linea |
databasecode |
cat-colpos |
tag |
biblioteca |
region |
America del Norte |
libraryname |
Departamento de documentación y biblioteca de COLPOS |
language |
eng |
topic |
Mathematics. Computers. Mathematical logic. Mathematics. Mathematics, general. Computation by Abstract Devices. Mathematical Logic and Formal Languages. Mathematical Logic and Foundations. Mathematics. Computers. Mathematical logic. Mathematics. Mathematics, general. Computation by Abstract Devices. Mathematical Logic and Formal Languages. Mathematical Logic and Foundations. |
spellingShingle |
Mathematics. Computers. Mathematical logic. Mathematics. Mathematics, general. Computation by Abstract Devices. Mathematical Logic and Formal Languages. Mathematical Logic and Foundations. Mathematics. Computers. Mathematical logic. Mathematics. Mathematics, general. Computation by Abstract Devices. Mathematical Logic and Formal Languages. Mathematical Logic and Foundations. Börger, E. editor. Hasenjaeger, G. editor. Rödding, D. editor. SpringerLink (Online service) 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 / |
description |
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. |
format |
Texto |
topic_facet |
Mathematics. Computers. Mathematical logic. Mathematics. Mathematics, general. Computation by Abstract Devices. Mathematical Logic and Formal Languages. Mathematical Logic and Foundations. |
author |
Börger, E. editor. Hasenjaeger, G. editor. Rödding, D. editor. SpringerLink (Online service) |
author_facet |
Börger, E. editor. Hasenjaeger, G. editor. Rödding, D. editor. SpringerLink (Online service) |
author_sort |
Börger, E. editor. |
title |
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 / |
title_short |
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 / |
title_full |
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 / |
title_fullStr |
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 / |
title_full_unstemmed |
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 / |
title_sort |
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 / |
publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg, |
publishDate |
1984 |
url |
http://dx.doi.org/10.1007/3-540-13331-3 |
work_keys_str_mv |
AT borgereeditor logicandmachinesdecisionproblemsandcomplexityelectronicresourceproceedingsofthesymposiumrekursivekombinatorikheldfrommay23281983attheinstitutfurmathematischelogikundgrundlagenforschungderuniversitatmunsterwestfalen AT hasenjaegergeditor logicandmachinesdecisionproblemsandcomplexityelectronicresourceproceedingsofthesymposiumrekursivekombinatorikheldfrommay23281983attheinstitutfurmathematischelogikundgrundlagenforschungderuniversitatmunsterwestfalen AT roddingdeditor logicandmachinesdecisionproblemsandcomplexityelectronicresourceproceedingsofthesymposiumrekursivekombinatorikheldfrommay23281983attheinstitutfurmathematischelogikundgrundlagenforschungderuniversitatmunsterwestfalen AT springerlinkonlineservice logicandmachinesdecisionproblemsandcomplexityelectronicresourceproceedingsofthesymposiumrekursivekombinatorikheldfrommay23281983attheinstitutfurmathematischelogikundgrundlagenforschungderuniversitatmunsterwestfalen |
_version_ |
1756268721041571840 |