Logic and machines : decision problems and complexity : proceedings of the symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Matematische Logik und Grundlagenforshung der Universität Münster, Westfalen
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | , , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin ; Heidelberg :
Springer-Verlag : Springer e-books
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
171 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic and machines, decision problems and complexity, proceedings, of the symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Matematische Logik und Grundlagenforshung der Universität Münster, Westfalen, edited by E. Börger, G. Hasenjaeger and D. Rödding, 1984, Berlin, Springer, 1 vol. (VI-456 p.), Lecture notes in computer science, 3-540-13331-3 • Logic and Machines: Decision Problems and Complexity, Texte imprimé, 9783662196359 |
| LEADER | 04581nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 945024 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155211749 | ||
| 020 | |a 9783540388562 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 511 | ||
| 111 | 2 | |a Symposium "Rekursive Kombinatorik" |d (1983 |c :Münster, Westfalen, Allemagne). | |
| 245 | 1 | 0 | |a Logic and machines : |b decision problems and complexity : proceedings of the symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Matematische Logik und Grundlagenforshung der Universität Münster, Westfalen |c edited by E. Börger, G. Hasenjaeger and D. Rödding. |
| 260 | |a Berlin ; |a Heidelberg : |b Springer-Verlag : |b Springer e-books. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 171 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Prise de décision | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Automates | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Börger, Egon, |d 1946- |4 pbd | |
| 700 | 1 | |a Hasenjaeger, Gisbert, |d 1919-2006. |4 pbd | |
| 700 | 1 | |a Rödding, Dieter, |d 1937-1984. |4 pbd | |
| 776 | 0 | |0 025803409 |t Logic and machines |o decision problems and complexity |o proceedings |o of the symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Matematische Logik und Grundlagenforshung der Universität Münster, Westfalen |f edited by E. Börger, G. Hasenjaeger and D. Rödding |d 1984 |c Berlin |n Springer |p 1 vol. (VI-456 p.) |s Lecture notes in computer science |z 3-540-13331-3 | |
| 776 | 0 | |t Logic and Machines: Decision Problems and Complexity |b Texte imprimé |z 9783662196359 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-13331-3 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-DZKFQSCB-0 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747914311 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-13331-3 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750927038 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-13331-3 |z Accès INSA CVL | |
| 997 | |0 945024 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||