An estimate of irremovable nonconstant terms in the reducibility problem

1995 ◽  
pp. 91-128 ◽  
Author(s):  
Dmitry V. Treshchev
Keyword(s):  
Reducibility Problem

Identification of static errors-in-variables models: the rank reducibility problem

Automatica ◽  
2001 ◽  
Vol 37 (7) ◽  
pp. 1079-1084 ◽  
Author(s):  
Umberto Soverini ◽  
Sergio Beghelli
Keyword(s):  
Errors In Variables ◽  
Reducibility Problem

scholarly journals Alternate Formulations of the Reducibility Problem of Open Shop Sequences Minimizing the Makespan

1970 ◽  
Vol 8 (1-2) ◽  
pp. 243-254
Author(s):  
Tanka Nath Dhamala
Keyword(s):  
Conflict Resolution ◽  
Decision Problem ◽  
Completion Time ◽  
Open Shop ◽  
Comparability Graph ◽  
Open Problems ◽  
Special Cases ◽  
Sequence Graph ◽  
Reducibility Problem ◽  
Maximum Completion Time

The decision problem whether a given open shop sequence, minimizing the maximum completion time, is irreducible has been considered in the last 20 years. The problem has diversified applications in industries and communications. By now, a number of algorithms based on the specific properties of the corresponding sequence graph are proposed. Thus the problem is solved only partially and only in some special cases, but not in general yet. A number of open problems and conjectures carried out in this research have been posed, so far. In this paper, we present a brief sketch of these ideas with different formulations of the reducibility of open shop sequences and expose how important are the roles of conflict resolution reaching a conclusion to its end. Paths on the so-called H-comparability graphs with respect to the implication classes play vital roles in it.Key words: Scheduling; Sequencing; Open shop; Comparability graph; reducibility; ComplexityDOI: http://dx.doi.org/10.3126/jie.v8i1-2.5117Journal of the Institute of Engineering Vol. 8, No. 1&2, 2010/2011Page: 243-254Uploaded Date: 20 July, 2011

scholarly journals A reducibility problem for even unitary groups: The depth zero case

2021 ◽  
Vol 573 ◽  
pp. 663-711
Author(s):  
Subha Sandeep Repaka
Keyword(s):  
Unitary Groups ◽  
Reducibility Problem

scholarly journals Renormalization of diophantine skew flows, with applications to the reducibility problem

2008 ◽  
Vol 21 (2) ◽  
pp. 477-500 ◽  
Author(s):  
Hans Koch ◽  
◽  
João Lopes Dias ◽  
Keyword(s):  
Reducibility Problem

Post’s reducibility problem

1993 ◽  
pp. 73-76
Author(s):  
Vladimir Uspensky ◽  
Alexei Semenov
Keyword(s):  
Reducibility Problem
Sign in / Sign up

Export Citation Format

Share Document