The following pages link to Kazuhisa Makino (Q171929):
Displaying 50 items.
- Deductive inference for the interiors and exteriors of horn theories (Q2946672) (← links)
- Markov decision processes and stochastic games with total effective payoff (Q2954987) (← links)
- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs (Q2971158) (← links)
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (Q3012799) (← links)
- Nonadaptive broadcasting in trees (Q3082604) (← links)
- Computing Knapsack Solutions with Cardinality Robustness (Q3104670) (← links)
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities (Q3149887) (← links)
- A linear time algorithm for recognizing regular Boolean functions (Q3150280) (← links)
- The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames (Q3503628) (← links)
- On Berge Multiplication for Monotone Boolean Dualization (Q3521907) (← links)
- Minimum Cost Source Location Problems with Flow Requirements (Q3525810) (← links)
- On computing all abductive explanations from a propositional Horn theory (Q3546348) (← links)
- Online Minimization Knapsack Problem (Q3558925) (← links)
- POSI-MODULAR SYSTEMS WITH MODULOTONE REQUIREMENTS UNDER PERMUTATION CONSTRAINTS (Q3560061) (← links)
- Minimum Transversals in Posimodular Systems (Q3563946) (← links)
- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information (Q3569829) (← links)
- New results on monotone dualization and generating hypergraph transversals (Q3579198) (← links)
- Caching Is Hard – Even in the Fault Model (Q3586462) (← links)
- Deductive Inference for the Interiors and Exteriors of Horn Theories (Q3596735) (← links)
- Generating Minimal k-Vertex Connected Spanning Subgraphs (Q3608847) (← links)
- On the Boolean Connectivity Problem for Horn Relations (Q3612466) (← links)
- On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions (Q3612585) (← links)
- (Q3622253) (← links)
- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (Q3638034) (← links)
- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs (Q3639242) (← links)
- Online Knapsack Problems with Limited Cuts (Q3652222) (← links)
- Posi-modular Systems with Modulotone Requirements under Permutation Constraints (Q3652235) (← links)
- (Q4249522) (← links)
- (Q4251064) (← links)
- Horn Extensions of a Partially Defined Boolean Function (Q4268864) (← links)
- (Q4331290) (← links)
- (Q4370203) (← links)
- (Q4370222) (← links)
- The Maximum Latency and Identification of Positive Boolean Functions (Q4376178) (← links)
- (Q4381405) (← links)
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions (Q4386450) (← links)
- (Q4427863) (← links)
- (Q4449202) (← links)
- (Q4511231) (← links)
- (Q4525718) (← links)
- (Q4535012) (← links)
- (Q4536430) (← links)
- Linear Satisfiability Preserving Assignments (Q4605203) (← links)
- Online Knapsack Problem Under Concave Functions (Q4632207) (← links)
- Surrogate Optimization for p-Norms (Q4636524) (← links)
- (Q4636525) (← links)
- (Q4664045) (← links)
- (Q4673411) (← links)
- (Q4703853) (← links)
