• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

• 1984
• 
  Egon Börger, Gisbert Hasenjaeger, Dieter Rödding:
  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 Grundlagenforschung der Universität Münster/Westfalen. Lecture Notes in Computer Science 171, Springer 1984, ISBN 3-540-13331-3 [contents]
• 1983
• 
  Stål Aanderaa:
  On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann class with identity. Logic and Machines 1983: 270-284
• 
  Klaus Ambos-Spies:
  P-mitotic sets. Logic and Machines 1983: 1-23
• 
  Andreas Blass, Yuri Gurevich:
  Equivalence relations, invariants, and normal forms. Logic and Machines 1983: 24-42
• 
  Christian Blatter, Ernst Specker:
  Recurrence relations for the number of labeled structures on a finite set. Logic and Machines 1983: 43-61
• 
  Egon Börger:
  Spektralproblem and completeness of logical decision problems. Logic and Machines 1983: 333-356
• 
  Anne Brüggemann-Klein, Lutz Priese, Dieter Rödding, Rüdiger Schätz:
  Modular decomposition of automata. Logic and Machines 1983: 198-236
• 
  Bruno Buchberger:
  A critical-pair/completion algorithm for finitely generated ideals in rings. Logic and Machines 1983: 137-161
• 
  Hans Kleine Büning:
  Complexity of loop-problems in normed networks. Logic and Machines 1983: 254-269
• 
  Hans Georg Carstens, Peter Päppinghaus:
  Extensible algorithms. Logic and Machines 1983: 162-182
• 
  Daniel E. Cohen:
  Modular machines, undecidability and incompleteness. Logic and Machines 1983: 237-247
• 
  Elias Dahlhaus:
  Reduction to NP-complete problems by interpretations. Logic and Machines 1983: 357-365
• 
  Michael Deutsch:
  Reductions for the satisfiability with a simple interpretation of the predicate variable. Logic and Machines 1983: 285-311
• 
  Martin Fürer:
  The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). Logic and Machines 1983: 312-319
• 
  Etienne Grandjean:
  Universal quantifiers and time complexity of random access machines. Logic and Machines 1983: 366-379
• 
  Gisbert Hasenjaeger:
  Universal Turing machines (UTM) and Jones-Matijasevich-masking. Logic and Machines 1983: 248-253
• 
  Ulrich Hedtstück:
  On the argument complexity of multiply transitive Boolean functions. Logic and Machines 1983: 390-396
• 
  Mark R. Kramer, Jan van Leeuwen:
  The VLSI complexity of Boolean functions. Logic and Machines 1983: 397-407
• 
  Wolfgang Menzel, Volker Sperschneider:
  Recursively enumerable extensions of R₁ by finite functions. Logic and Machines 1983: 62-76
• 
  Walter Oberschelp:
  Fast parallel algorithms for finding all prime implicants for discrete functions. Logic and Machines 1983: 408-420
• 
  Pavel Pudlák:
  Bounds for Hodes-Specker theorem. Logic and Machines 1983: 421-445
• 
  Kenneth W. Regan:
  Arithmetical degrees of index sets for complexity classes. Logic and Machines 1983: 118-130
• 
  Michael M. Richter:
  Some reordering properties for inequality proof trees. Logic and Machines 1983: 183-197
• 
  Bruno Scarpellini:
  Second order spectra. Logic and Machines 1983: 380-389
• 
  Diana Schmidt:
  On the complement of one complexity class in another. Logic and Machines 1983: 77-87
• 
  Volker Sperschneider:
  The length-problem. Logic and Machines 1983: 88-102
• 
  Dieter Spreen:
  On r.e. inseparability of CPO index sets. Logic and Machines 1983: 103-117
• 
  Jerzy Tiuryn:
  Implicit definability of finite binary trees by sets of equations. Logic and Machines 1983: 320-332
• 
  Hugo Volger:
  Rudimentary relations and Turing machines with linear alternation. Logic and Machines 1983: 131-136
• 
  Ingo Wegener:
  Proving lower bounds of the monotone complexity of Boolean functions. Logic and Machines 1983: 446-456