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
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin ; Heidelberg :
Springer-Verlag : Springer e-books
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
171 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
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 |
Sisällysluettelo:
- 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.