• 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 15 matches

• 2004
• 
  Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
  Dual-bounded generating problems: weighted transversals of a hypergraph. Discret. Appl. Math. 142(1-3): 1-15 (2004)
• 
  Jianer Chen, Iyad A. Kanj:
  Improved exact algorithms for M_AX-S_AT. Discret. Appl. Math. 142(1-3): 17-27 (2004)
• 
  Miguel Couceiro, Stephan Foldes:
  Definability of Boolean function classes by linear equations over GF(2). Discret. Appl. Math. 142(1-3): 29-34 (2004)
• 
  Stephan Foldes, Peter L. Hammer:
  Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. Discret. Appl. Math. 142(1-3): 53-65 (2004)
• 
  Stephan Foldes, Grant R. Pogosyan:
  Post classes characterized by functional terms. Discret. Appl. Math. 142(1-3): 35-51 (2004)
• 
  Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
  Ordered binary decision diagrams and the Shannon effect. Discret. Appl. Math. 142(1-3): 67-85 (2004)
• 
  Takashi Horiyama, Toshihide Ibaraki:
  Reasoning with ordered binary decision diagrams. Discret. Appl. Math. 142(1-3): 151-163 (2004)
• 
  Lars Magnus Hvattum, Arne Løkketangen, Fred W. Glover:
  Adaptive memory search for Boolean optimization problems. Discret. Appl. Math. 142(1-3): 99-109 (2004)
• 
  Frank K. Hwang, J. S. Lee, Uriel G. Rothblum:
  Permutation polytopes corresponding to strongly supermodular functions. Discret. Appl. Math. 142(1-3): 87-97 (2004)
• 
  Sergei O. Kuznetsov:
  Complexity of learning in concept lattices from positive and negative examples. Discret. Appl. Math. 142(1-3): 111-125 (2004)
• 
  Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
  A decomposability index in logical analysis of data. Discret. Appl. Math. 142(1-3): 165-180 (2004)
• 
  Rocco A. Servedio:
  Monotone Boolean formulas can approximate monotone linear threshold functions. Discret. Appl. Math. 142(1-3): 181-187 (2004)
• 
  Tonguç Ünlüyurt:
  Sequential testing of complex systems: a review. Discret. Appl. Math. 142(1-3): 189-205 (2004)
• 
  Tianbing Xia, Jennifer Seberry, Josef Pieprzyk, Chris Charnes:
  Homogeneous bent functions of degree n in 2n variables do not exist for nge3. Discret. Appl. Math. 142(1-3): 127-132 (2004)
• 
  Jiawei Zhang, Yinyu Ye, Qiaoming Han:
  Improved approximations for max set splitting and max NAE SAT. Discret. Appl. Math. 142(1-3): 133-149 (2004)