#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1951

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kazuyoshi Hayase, Hiroshi Imai
- ISAAC
- 1996

- Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani
- COCOON
- 1995

This paper investigates output-size sensitiveness of construction of OBDD by analyzing the maximal independent set problem of a graph, which would give several insights to e cient manipulation of Boolean functions by OBDD and graph theory.

- Tsuyoshi Ono, Yoshiaki Kyoda, +7 authors David Avis
- Symposium on Computational Geometry
- 1996

Recently, triangulations of a point set have been intensively studied in computational geometry. Triangulations are very important not only from the viewpoint of their applications to computer graphics, numerical analysis but also from a fact that triangulations are yet another fundamental structure in discrete geometry like hyperplane arrangements. Ourā¦ (More)

- Kazuyoshi Hayase, Hiroshi Imai
- Theory of Computing Systems
- 1998

Coudert made a breakthrough in the two-level logic minimization problem with Ordered Binary Decision Diagrams (OBDDs for short) recently [3]. This paper discusses the relationship between the two OBDDs of a monotone function and its prime implicant set to clarify the complexity of this practically efficient method. We show that there exists a monotoneā¦ (More)

In this paper, we study the computational power of an SIMD type parallel computation model with simple processors, called cube-APA. Some relationships between the computational power of cube-APAs that run with at most k alternations in communication and the polynomial time hierarchy are stated.

- ā¹
- 1
- āŗ