Arrow Research search

Author name cluster

Thomas Lengauer

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

8 papers
2 author rows

Possible papers

8

TCS Journal 1990 Journal Article

The binary network flow problem is logspace complete for P

  • Thomas Lengauer
  • Klaus W. Wagner

It is shown that the problem of whether the maximum flow in a given network exceeds a given natural number is logspace many-one complete for P if the edge capacities are presented in binary (even if the problem is restricted to acyclic graphs). This improves a result by Goldschlager et al. (1982) that this problem is logspace Turing complete for P.

Details DOI

FOCS Conference 1982 Conference Paper

The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version)

  • Thomas Lengauer

In many CAD systems for VLSI design the specification of a layout is internally represented by a set of geometric constraints that take the form of linear inequalities between pairs of layout components. Some of the constraints may be explicitly stated by the circuit designer. Others are internally generated by the CAD system, using the design rules of the fabrication process. Layout compaction is then equivalent to finding a minimum area layout satisfying all constraints. We discuss the complexity of the constraint resolution problem arising in this context. Hereby we allow circuits to be specified hierarchically. The complexity of the constraint resolution is then measured in terms of the length of the hierarchical specification. We show the following results: 1. It is decidable in polynomial (cubic) time whether a given hierarchical layout specification yields a consistent set of geometric constraints. The size of minimum area layouts satisfying the constraints can also be determined in cubic time. 2. For every layout specification that is consistent a hierarchical description L of a minimum area layout can be computed in polynomial time in the length of L. 3. There is a consistent layout specification with the following property: No layout satisfying the constraints is concise, i. e. , every hierarchical layout description consistent with the specification has a length which grows exponentially in the length of the specification. 4. We define a subclass of so-called well-formed layout specifications. Each well-formed specification has a concise layout, which can be hierarchically described in linear space. Such a layout can be found in polynomial time. However, it is in general not a minimum area layout. Indeed, there is a consistent well-formed specification all of whose minimum area layouts are inconcise, .i. e. , need exponential space to be described.

Details