Adjoining conjugating elements to finite groups
Kenneth Keller Hickin (1981)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups.”
Adjoining conjugating elements to finite groups
Algorithm 61. The solution of a certain linear equation system
Z. Kasperski (1978)
Applicationes Mathematicae
Similarity:
Remarks on algorithm 3
Z. Cylkowski, J. Kucharczyk (1970)
Applicationes Mathematicae
Similarity:
Remarks on algorithm 32
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Algorithm 8. A program to shorten a sequence of sets of integer numbers
Krystyna Jerzykiewicz (1970)
Applicationes Mathematicae
Similarity:
Algorithm 24. One-dimensional knapsack function
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity:
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
A. Adrabiński (1976)
Applicationes Mathematicae
Similarity:
Algorithm 83. Stepwise selection of discriminative variables by the use of the trace criterion
Anna Bartkowiak (1982)
Applicationes Mathematicae
Similarity:
On the Neumann problem with combined nonlinearities
Jan Chabrowski, Jianfu Yang (2005)
Annales Polonici Mathematici
Similarity:
We establish the existence of multiple solutions of an asymptotically linear Neumann problem. These solutions are obtained via the mountain-pass principle and a local minimization.
Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
Trimming.
Cooper, Daryl, Long, Darren D. (1998)
Experimental Mathematics
Similarity:
Algorithm 37. Solution of sparse linear equation systems
F. Pankowski (1974)
Applicationes Mathematicae
Similarity:
Algorithm 31. The calculation of the minimum of a certain function of several variables
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
Algorithm 49. An algorithm for solving the machine sequencing problem
A. Adrabiński, J. Grabowski (1977)
Applicationes Mathematicae
Similarity:
The von Neumann minimax theorem revisited
Hichem Ben-El-Mechaiekh, Robert Dimand (2007)
Banach Center Publications
Similarity:
A modified algorithm for the strict feasibility problem
D. Benterki, B. Merikhi (2010)
RAIRO - Operations Research
Similarity:
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
Algorithm 12. Minimum of a function of one variable
Z. Cylkowski (1971)
Applicationes Mathematicae
Similarity:
On the Neumann problem with L¹ data
J. Chabrowski (2007)
Colloquium Mathematicae
Similarity:
We investigate the solvability of the linear Neumann problem (1.1) with L¹ data. The results are applied to obtain existence theorems for a semilinear Neumann problem.