The following pages link to Atsuki Nagao (Q722516):
Displaying 10 items.
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- Topological graph description of multicellular dynamics based on vertex model (Q1752391) (← links)
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
- Read-Once Branching Programs for Tree Evaluation Problems. (Q2965502) (← links)
- A Moderately Exponential Time Algorithm for k-IBDD Satisfiability (Q3449853) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- Read-Once Branching Programs for Tree Evaluation Problems (Q5205806) (← links)
- Efficient Algorithms for Sorting k-Sets in Bins (Q5746260) (← links)
- Card-based ZKP protocols for Takuzu and Juosan (Q6487593) (← links)
