2446 search results - page 361 / 490 » Choiceless Polynomial Time |
JSC
2006
13 years 7 months ago
2006
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
EOR
2007
13 years 7 months ago
2007
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
FUIN
2007
13 years 7 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
AML
2005
13 years 7 months ago
2005
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
TCS
2008
13 years 7 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...