Don't-care term

Known as: Don't-care (logic), Don't care, Can't happen 
In digital logic, a don't-care term for a function is an input-sequence (a series of bits) for which the function output does not matter. An input… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
This paper considers various flavors of the following online problem: preprocess a text or collection of strings, so that given a… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Given a test set for stuck-at faults of a combinational circuit or a full-scan sequential circuit, some of the primary input… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
1997
1997
In many computer-aided design tools, binary decision diagrams(BDDs) are used to represent Boolean functions. To increase… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
1995
1995
This paper presents an O( p kmnpolylog(m)) time algorithm for approximate string matching (k-di erences problem), in which don't… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Suppose you are given a set of natural entities (e.g., proteins, organisms, weather patterns, etc.) that possess some important… (More)
  • figure 2
  • table 1
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
1992
1992
An important factor in the optimization of a multi-level circuit, modeled as a Boolean network, is to compute the flexibility for… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We give an algorithm for computing subsets of observability don't cares at the nodes of a multi-level Boolean network. These… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We describe a new approach to technology mapping where matchings are recognized by means of Boolean operations. The matching… (More)
Is this relevant?
1990
1990
A new algorithm is presented that computes exact or approximate ob-servability don't care (ODC) sets for multiple-level… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with don't… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?