A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
A coin tossing algorithm for counting large numbers of events
A comparison of multiobjective evolutionary algorithms.
A complete characterization of primitive recursive intensional behaviours
We give a complete characterization of the class of functions that are the intensional behaviours of primitive recursive (PR) algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers.
A Complexity Calculus for Recursive Tree Algorithms
A connection between Computer Science and Fuzzy Theory: Midpoints and running time of computing.
A deterministic subclass of context-free languages
A Divide and Conquer Method for the Symmetric Tridiagonal Eigenproblem.
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs
We characterize the class [...] L32 of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs. We also give an O(n)-time algorithm for the recognition of graphs from [...] L32 in the class of threshold graphs, where n is the number of vertices of a tested graph.
A Geometric Inequality and the Complexity of Computing Volume.
A geometrical method in combinatorial complexity
A lower bound for the number of comparisons is obtained, required by a computational problem of classification of an arbitrarily chosen point of the Euclidean space with respect to a given finite family of polyhedral (non-convex, in general) sets, covering the space. This lower bound depends, roughly speaking, on the minimum number of convex parts, into which one can decompose these polyhedral sets. The lower bound is then applied to the knapsack problem.
A Linear Algorithm for Construction of Optimal Digital Convex 2k-gons
A linear time algorithm for the computation of some distance functions between convex polygons
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
A linear-time algorithm to decide whether a binary word contains an overlap
A modified standard embedding for linear complementarity problems
We propose a modified standard embedding for solving the linear complementarity problem (LCP). This embedding is a special one-parametric optimization problem . Under the conditions (A3) (the Mangasarian–Fromovitz Constraint Qualification is satisfied for the feasible set depending on the parameter ), (A4) ( is Jongen–Jonker– Twilt regular) and two technical assumptions, (A1) and (A2), there exists a path in the set of stationary points connecting the chosen starting point for with a certain...
A more efficient notion of zigzag stability
A new algorithm for the four counterfeit coins problem.
A New Approach to the Dynamic Maintenance of Maximal Points in a Plane.