The following pages link to Shin-ichi Minato (Q313769):
Displayed 33 items.
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- (Q456067) (redirect page) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- (Q620747) (redirect page) (← links)
- Low energy processes associated with spontaneously broken \({\mathcal N}=2\) supersymmetry (Q620748) (← links)
- Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration (Q782183) (← links)
- Designing survivable networks with zero-suppressed binary decision diagrams (Q782194) (← links)
- Zero-suppressed BDDs and their applications (Q1606803) (← links)
- Finding all solutions and instances of Numberlink and Slitherlink by ZDDs (Q1736507) (← links)
- Exact computation of strongly connected reliability by binary decision diagrams (Q2327117) (← links)
- Evaluation of hotspot cluster detection using spatial scan statistic based on exact counting (Q2329882) (← links)
- DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
- On the properties of combination set operations. (Q2583562) (← links)
- Improved Algorithms for Debugging Problems on Erroneous Reversible Circuits (Q2822511) (← links)
- Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets (Q2849361) (← links)
- An Efficient Method for Indexing All Topological Orders of a Directed Graph (Q2942618) (← links)
- Generating All Patterns of Graph Partitions Within a Disparity Bound (Q2980904) (← links)
- πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space (Q3007676) (← links)
- Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits (Q3186599) (← links)
- Using πDDs in the Design of Reversible Circuits (Q3453752) (← links)
- (Q4643858) (← links)
- (Q4864698) (← links)
- (Q4885881) (← links)
- Shared-Memory Parallel Frontier-Based Search (Q4914446) (← links)
- Discrete Structure Manipulation for Discovery Science Problems (Q4932737) (← links)
- Enumerating Eulerian Trails via Hamiltonian Path Enumeration (Q5176581) (← links)
- Superset Generation on Decision Diagrams (Q5176594) (← links)
- (Q5389336) (← links)
- Sorting balls and water: equivalence and computational complexity (Q6050130) (← links)
- Graph minors from simulated annealing for annealing machines with sparse connectivity (Q6073022) (← links)
- Decomposing a Graph into Unigraphs (Q6317509) (← links)
- Enumeration of associative magic squares of order 7 (Q6320670) (← links)
- Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration (Q6329368) (← links)