Toshihide Ibaraki

From MaRDI portal
Revision as of 21:08, 22 September 2023 by Import230922100944 (talk | contribs) (Created automatically from import230922100944)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:171928

Available identifiers

zbMath Open ibaraki.toshihideWikidataQ11617848 ScholiaQ11617848MaRDI QIDQ171928

List of research outcomes





PublicationDate of PublicationType
An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem2023-04-24Paper
Two arc disjoint paths in Eulerian digraphs2023-03-21Paper
A fast and simple algorithm for identifying 2-monotonic positive Boolean functions2023-03-21Paper
Boolean analysis of incomplete examples2022-12-09Paper
A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem2022-08-30Paper
Optimal coteries for rings and related networks2020-11-30Paper
A note on minimizing submodular functions2016-06-09Paper
https://portal.mardi4nfdi.de/entity/Q55018442015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55018522015-08-14Paper
An approximation of the minimum vertex cover in a graph2015-03-03Paper
A fast algorithm for cactus representations of minimum cuts2015-03-03Paper
Recent progress of local search in handling the time window constraints of the vehicle routing problem2013-08-08Paper
https://portal.mardi4nfdi.de/entity/Q46479702012-11-08Paper
An Ejection Chain Approach for the Generalized Assignment Problem2012-06-08Paper
Logical analysis of data: classification with justification2011-11-17Paper
Efficient branch-and-bound algorithms for weighted MAX-2-SAT2011-05-11Paper
Recent progress of local search in handling the time window constraints of the vehicle routing problem2010-12-06Paper
COMPUTING BOUNDS ON RISK-NEUTRAL DISTRIBUTIONS FROM THE OBSERVED PRICES OF CALL OPTIONS2010-06-10Paper
A personal perspective on problem solving by general purpose solvers2010-06-08Paper
Solving the irregular strip packing problem via guided local search for overlap minimization2010-01-29Paper
https://portal.mardi4nfdi.de/entity/Q36324442009-06-11Paper
Scheduling of corrugated paper production2009-04-08Paper
Translation among CNFs, characteristic models and ordered binary decision diagrams2009-03-23Paper
A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem2009-03-23Paper
Algorithmic Aspects of Graph Connectivity2008-12-04Paper
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows2008-10-29Paper
https://portal.mardi4nfdi.de/entity/Q35310282008-10-21Paper
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions2008-09-10Paper
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem2007-11-29Paper
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route2007-11-29Paper
Duality in option pricing based on prices of other derivatives2007-08-27Paper
The complexity of assigning genotypes to people in a pedigree consistently2007-06-26Paper
Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34264352007-03-09Paper
The vehicle routing problem with flexible time windows and traveling times2007-01-09Paper
Minimum edge ranking spanning trees of split graphs2007-01-09Paper
Complexity of identification and dualization of positive Boolean functions2006-10-10Paper
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming2006-09-28Paper
Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph2006-06-14Paper
A 3-flip neighborhood local search for the set covering problem2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q33686592006-02-08Paper
A path relinking approach with ejection chains for the generalized assignment problem2005-10-26Paper
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem2005-08-22Paper
Lowering eccentricity of a tree by node upgrading2005-08-05Paper
Improved local search algorithms for the rectangle packing problem with general spatial costs2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q54616032005-07-26Paper
Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships2005-06-13Paper
Greedy splitting algorithms for approximating multiway partition problems2005-03-17Paper
On generalized greedy splitting algorithms for multiway partition problems2004-11-23Paper
Reasoning with ordered binary decision diagrams2004-08-19Paper
A decomposability index in logical analysis of data2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44724852004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44740922004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44740962004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741332004-08-04Paper
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.2004-01-05Paper
Convex embeddings and bisections of 3-connected graphs2003-10-14Paper
Interior and exterior functions of positive Boolean functions.2003-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44278632003-09-14Paper
Local search algorithms for the rectangle packing problem with general spatial costs2003-09-01Paper
Finding essential attributes from binary data2003-08-21Paper
Variations on extending partially defined Boolean functions with missing bits.2003-08-13Paper
https://portal.mardi4nfdi.de/entity/Q44089642003-06-29Paper
Inferring minimal functional dependencies in Horn and q-Horn theories2003-06-09Paper
One-dimensional cutting stock problem to minimize the number of different patterns2003-04-10Paper
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs2003-03-09Paper
Recognition and dualization of disguised bidual Horn functions.2003-01-21Paper
Logical analysis of data with decomposable structures.2003-01-21Paper
Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation2002-12-15Paper
https://portal.mardi4nfdi.de/entity/Q45364302002-11-25Paper
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem2002-09-30Paper
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks2002-09-29Paper
Graph connectivity and its augmentation: Applications of MA orderings2002-09-17Paper
https://portal.mardi4nfdi.de/entity/Q45483312002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q45483372002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q45487832002-08-26Paper
A tabu search approach to the constraint satisfaction problem as a general problem solver2002-08-18Paper
Logical analysis of binary data with missing bits2002-07-24Paper
Computing intersections of Horn theories for reasoning with models2002-07-24Paper
On functional dependencies in \(q\)-Horn theories2002-07-24Paper
https://portal.mardi4nfdi.de/entity/Q27668492002-07-22Paper
Ordered binary decision diagrams as knowledge-bases2002-07-15Paper
Disjunctions of Horn Theories and Their Cores2002-04-23Paper
Decision lists and related Boolean functions2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27625262002-01-09Paper
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts2002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q27765752002-01-01Paper
Multigraph augmentation under biconnectivity and general edge-connectivity requirements2001-12-19Paper
https://portal.mardi4nfdi.de/entity/Q45112432001-11-28Paper
https://portal.mardi4nfdi.de/entity/Q27539372001-11-11Paper
On the difference of Horn theories2001-10-30Paper
Augmenting a submodular and posi-modular set function by a multigraph2001-09-19Paper
https://portal.mardi4nfdi.de/entity/Q27437982001-09-17Paper
On Minimum Edge Ranking Spanning Trees2001-07-23Paper
Totally balanced combinatorial optimization games2001-06-10Paper
Analyses on the 2 and 3-flip neighborhoods for the MAX SAT2001-03-04Paper
A fast algorithm for computing minimum 3-way and 4-way cuts2001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q47619452001-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47619472001-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47619502001-02-21Paper
Polyhedral structure of submodular and posi-modular systems2001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45257002001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q45257182001-01-24Paper
Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph2001-01-14Paper
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs2000-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45112192000-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45112402000-10-30Paper
A variable depth search algorithm with branching search for the generalized assignment problem2000-10-29Paper
https://portal.mardi4nfdi.de/entity/Q42474492000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q45053882000-09-27Paper
Optimal scheduling in parallel and serial manufacturing systems via the maximum principle2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q49491512000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q44949382000-08-20Paper
https://portal.mardi4nfdi.de/entity/Q44952042000-08-10Paper
Boolean Normal Forms, Shellability, and Reliability Computations2000-07-20Paper
A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs2000-07-19Paper
Algorithmic Aspects of the Core of Combinatorial Optimization Games2000-07-19Paper
https://portal.mardi4nfdi.de/entity/Q49387842000-03-27Paper
Minimum self-dual decompositions of positive dual-minor Boolean functions2000-03-02Paper
https://portal.mardi4nfdi.de/entity/Q49386572000-02-23Paper
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs2000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q49371262000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49371282000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49371412000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49371692000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49371772000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49371782000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49372072000-02-03Paper
Bidual Horn functions and extensions2000-01-17Paper
Inner-core and outer-core functions of partially defined Boolean functions2000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q47050301999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47031451999-12-14Paper
https://portal.mardi4nfdi.de/entity/Q47031541999-12-14Paper
https://portal.mardi4nfdi.de/entity/Q47038531999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q47038561999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q42534771999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42534781999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42510641999-11-07Paper
https://portal.mardi4nfdi.de/entity/Q42684321999-10-31Paper
Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time1999-10-28Paper
Horn Extensions of a Partially Defined Boolean Function1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42637251999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42495221999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42495241999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42495251999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42501931999-06-17Paper
Double-offer arbitration1999-05-26Paper
https://portal.mardi4nfdi.de/entity/Q42284551999-05-18Paper
Double Horn functions1999-05-16Paper
Functional dependencies in Horn theories1999-04-28Paper
A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons1999-03-14Paper
https://portal.mardi4nfdi.de/entity/Q43702021998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q42184121998-11-11Paper
The use of dynamic programming in genetic algorithms for permutation problems1998-10-18Paper
Two Arc-Disjoint Paths in Eulerian Digraphs1998-09-21Paper
Complexity Of The Single Vehicle Scheduling Problem On Graphs1998-09-07Paper
Error-free and best-fit extensions of partially defined Boolean functions1998-07-27Paper
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions1998-06-23Paper
https://portal.mardi4nfdi.de/entity/Q43702221998-05-25Paper
Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs1998-04-13Paper
https://portal.mardi4nfdi.de/entity/Q43702031998-04-01Paper
https://portal.mardi4nfdi.de/entity/Q43814051998-04-01Paper
The Maximum Latency and Identification of Positive Boolean Functions1998-02-10Paper
Computing All Small Cuts in an Undirected Network1998-02-09Paper
Searching minimax game trees under memory space constraint1997-12-14Paper
VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS1997-10-30Paper
Positive and Horn decomposability of partially defined Boolean functions1997-10-29Paper
Complexity of the Minimum Base Game on Matroids1997-10-05Paper
Logical analysis of numerical data1997-08-28Paper
https://portal.mardi4nfdi.de/entity/Q43500371997-08-28Paper
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle1997-08-03Paper
Hitting or avoiding balls in Euclidean space1997-06-16Paper
Vehicle scheduling on a tree with release and handling times1997-06-16Paper
Interior and exterior functions of Boolean functions1997-01-27Paper
A multisplitting method for symmetric linear complementarity problems1997-01-05Paper
Decompositions of positive self-dual Boolean functions1996-06-24Paper
https://portal.mardi4nfdi.de/entity/Q48708381996-03-26Paper
Decomposability of partially defined Boolean functions1996-03-11Paper
A parallel relaxation method for quadratic programming problems with interval constraints1996-02-18Paper
Implementing an efficient minimum capacity cut algorithm1995-09-27Paper
https://portal.mardi4nfdi.de/entity/Q48340321995-05-23Paper
A dynamic programming method for single machine scheduling1994-08-21Paper
A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS1994-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42867211994-04-04Paper
A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS1993-08-25Paper
On sparse subgraphs preserving connectivity properties1993-08-24Paper
A globally convergent Newton method for solving strongly monotone variational inequalities1993-08-17Paper
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control1993-05-16Paper
An optimal backup policy for a hard computer disk depending on age under availability criterion1993-04-01Paper
Optimal minimal-repair and replacement problem with age dependent cost structure1993-04-01Paper
Primal-dual proximal point algorithm for linearly constrained convex programming problems1993-02-04Paper
On the average optimality of circular assignment policy1993-01-17Paper
A linear time algorithm for computing 3-edge-connected components in a multigraph1993-01-16Paper
On Onaga's upper bound on the mean values of probabilistic maximum flows1993-01-16Paper
DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS1992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39930691992-09-17Paper
Successive linearization methods for large-scale nonlinear programming problems1992-06-28Paper
Optimal strategies for some team games1992-06-28Paper
A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph1992-06-28Paper
Counting the number of minimum cuts in undirected multigraphs1992-06-28Paper
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs1992-06-28Paper
An algorithm for the fair resource allocation problem with a submodular constraint1992-06-27Paper
Maximum flows in probabilistic networks1992-06-27Paper
Chain packing in graphs1991-01-01Paper
Multicommodity flows in certain planar directed networks1990-01-01Paper
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices1990-01-01Paper
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities1990-01-01Paper
On max-flow min-cut and integral flow properties for multicommodity flows in directed networks1989-01-01Paper
On generalized pseudoconvex functions1989-01-01Paper
An Efficient Trust Region Algorithm for Minimizing Nondifferentiable Composite Functions1989-01-01Paper
INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS1989-01-01Paper
A comparative study of several semi-infinite nonlinear programming algorithms1988-01-01Paper
A globally convergent SQP method for semi-infinite nonlinear optimization1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34915891988-01-01Paper
AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITIES WITH APPLICATION TO TRAFFIC EQUILIBRIUM PROBLEMS1988-01-01Paper
A cautious scheduler for multistep transactions1987-01-01Paper
A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37860291987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37889551987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37981991987-01-01Paper
Approximation algorithms for combinatorial fractional programming problems1987-01-01Paper
A generalization of alpha-beta and \(SSS^*\) search procedures1986-01-01Paper
Distances defined by neighborhood sequences1986-01-01Paper
Strong unimodularity for matrices and hypergraphs1986-01-01Paper
An efficient algorithm for the parametric resource allocation problem1985-01-01Paper
An Algorithm for the Equipollent Resource Allocation Problem1985-01-01Paper
Cautious transaction schedulers with admission control1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37341641985-01-01Paper
On-line computation of transitive closures of graphs1983-01-01Paper
A polynomial time algorithm for a chance-constrained single machine scheduling problem1983-01-01Paper
Bin packing and multiprocessor scheduling problems with side constraint on job types1983-01-01Paper
Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem1983-01-01Paper
Design of Minimum-Cost Deadlock-Free Systems1983-01-01Paper
Parametric approaches to fractional programs1983-01-01Paper
Fractional programming1983-01-01Paper
Deadlock-Free Systems for a Bounded Number of Processes1982-01-01Paper
An efficient algorithm for K shortest simple paths1982-01-01Paper
THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33185661981-01-01Paper
On Minimal Test Sets for Locating Single Link Failures in Networks1981-01-01Paper
An Algorithm for Finding K Minimum Spanning Trees1981-01-01Paper
An Algorithm for the K Best Solutions of the Resource Allocation Problem1981-01-01Paper
Sufficient Conditions for Graphs to Have Threshold Number 21981-01-01Paper
Threshold Sequences1981-01-01Paper
Threshold Numbers and Threshold Completions1981-01-01Paper
The number of additional variables required for the integer programming formulation1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38634291980-01-01Paper
APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS1980-01-01Paper
Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities1980-01-01Paper
Threshold Numbers and Threshold Completions1980-01-01Paper
PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES1979-01-01Paper
ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM1979-01-01Paper
A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32070001978-01-01Paper
Branch-and-bound procedure and state—space representation of combinatorial optimization problems1978-01-01Paper
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times1978-01-01Paper
THE MULTIPLE-CHOICE KNAPSACK PROBLEM1978-01-01Paper
Finite automata having cost functions: Nondeterministic models1978-01-01Paper
Depth-m search in branch-and-bound algorithms1978-01-01Paper
The Power of Dominance Relations in Branch-and-Bound Algorithms1977-01-01Paper
ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS1977-01-01Paper
Fractional knapsack problems1977-01-01Paper
On the optimality of algorithms for finite state sequential decision processes1976-01-01Paper
Integer programming formulation of combinatorial optimization problems1976-01-01Paper
Finite automata having cost functions1976-01-01Paper
AN ASSIGNMENT PROBLEM ON A NETWORK1976-01-01Paper
ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS1976-01-01Paper
Computational Efficiency of Approximate Branch-and-Bound Algorithms1976-01-01Paper
A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS1976-01-01Paper
Theoretical comparisons of search strategies in branch-and-bound algorithms1976-01-01Paper
Minimal representations of some classes of dynamic programming1975-01-01Paper
Classes of discrete optimization problems and their decision problems1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41246051974-01-01Paper
Comments on "Monotone Functions in Sequential Circuits"1974-01-01Paper
Solvable classes of discrete dynamic programming1973-01-01Paper
Finite State Representations of Discrete Optimization Problems1973-01-01Paper
Technical Note—The Use of Cuts in Complementary Programming1973-01-01Paper
Fail-safe realization of sequential machines1973-01-01Paper
Algorithms for Obtaining Shortest Paths Visiting Specified Nodes1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56393051972-01-01Paper
Design of Optimal Switching Networks by Integer Programming1972-01-01Paper
N-Fail-Safe Sequential Machines1972-01-01Paper
Representation theorems for equivalent optimization problems1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56613291972-01-01Paper
Synthesis of Networks with a Minimum Number of Negative Gates1971-01-01Paper
Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks1971-01-01Paper
Gate-Interconnection Minimization of Switching Networks Using Negative Gates1971-01-01Paper
Technical Note—Complementary Programming1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56502101971-01-01Paper
Adaptive Linear Classifier by Linear Programming1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55959001969-01-01Paper
Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic1968-01-01Paper
On Autonomous Logic Nets of Threshold Elements1968-01-01Paper
A Theory of Completely Monotonic Functions and its Applications to Threshold Logic1968-01-01Paper
A Lower Bound of the Number of Threshold Functions1965-01-01Paper

Research outcomes over time

This page was built for person: Toshihide Ibaraki

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:171928&oldid=5866496"
Powered by MediaWiki