Opened 12 years ago

Last modified 11 years ago

#301 new bug

char set slower in 3.1.0 compared to 3.0.4??

Reported by: seelisch Owned by: levandov
Priority: minor Milestone: 3-1-3 and higher
Component: dontKnow Version: 3-1-0
Keywords: char sets, minimal primes Cc:

Description

Example from Viktor, investigate (Hans, Gerhard)

Change History (3)

comment:1 Changed 12 years ago by seelisch

If this is true, then why did we not notice (by means of general test set when releasing a new version)?

comment:2 Changed 11 years ago by levandov

Excerpts from email correspondence of Valery Romanovski and Japanese guys from RISA/Asir team, 2009 are to be found below. As examples of computation nearly any example coming form Romanovski can be taken: there are complicated minimal primes. The most challenging examples can be found in my directory http://www.math.rwth-aachen.de/~Viktor.Levandovskyy/filez/chals/ (mckay.tst is the only examples not of this type). A typical one is http://www.math.rwth-aachen.de/~Viktor.Levandovskyy/filez/chals/vr_five11.tst .

I remember this change of performance on Romanovski's problems very distinctly, since minAssChar was our default instrument.

Regards, Viktor

Romanovski: ...with the recent version of Singular minAssGTZ found the decomposition in about 2 min, but minAssChar is still running (more than one hour).

Japanese:

  1. Unfortunately, your problem was too difficult to solve by our technique. This problem brought about huge coefficients over Q.
  2. We have recently found that in our problem, minAssChar in Singular 3-1-0 is about three times slower than that in Singular 3-0-4. We guess that this unfortunate phenomenon arises from a change of `factorization' of Singular 3-1-0.

comment:3 Changed 11 years ago by levandov

Keywords: char sets minimal primes added
Version: 3-1-23-1-0
Note: See TracTickets for help on using tickets.