# Don't-care term

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2004

Highly Cited

2004

- STOC
- 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

- IEEE Transactions on Computer-Aided Design ofâ€¦
- 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)

Is this relevant?

1997

1997

- DAC
- 1997

In many computer-aided design tools, binary decision diagrams(BDDs) are used to represent Boolean functions. To increaseâ€¦Â (More)

Is this relevant?

1995

1995

- Inf. Process. Lett.
- 1995

This paper presents an O( p kmnpolylog(m)) time algorithm for approximate string matching (k-di erences problem), in which don'tâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- SIGMOD Conference
- 1994

Suppose you are given a set of natural entities (e.g., proteins, organisms, weather patterns, etc.) that possess some importantâ€¦Â (More)

Is this relevant?

1992

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)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- DAC
- 1990

We give an algorithm for computing subsets of observability don't cares at the nodes of a multi-level Boolean network. Theseâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- EURO-DAC
- 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

- ICCAD
- 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

- SIGIR
- 1989

We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with don'tâ€¦Â (More)

Is this relevant?