Search results

• CoCoA:GB.Complete
  <short_description>Complete an interactive Groebner-type calculation</short_description> <type>groebner</type>
  559 bytes (64 words) - 10:02, 24 October 2007
• CoCoA:Ext
  IMPORTANT: the only exception to the type of M or N (or even of the In these cases their type is indeed MOD.
  4 KB (615 words) - 10:02, 24 October 2007
• CoCoA:IndetName
  Type(It); <type>ring</type>
  578 bytes (68 words) - 10:02, 24 October 2007
• ApCoCoA-1:LinBox.REF
  ...m of <tt>M</tt> mod <tt>P</tt> and the components of <tt>M</tt> must be of type <tt>INT</tt>. ...nts of <tt>M</tt> must be of type <tt>INT</tt>. Otherwise, they must be of type <tt>ZMOD</tt>.</item>
  3 KB (467 words) - 10:11, 7 October 2020
• ApCoCoA-1:IML.REF
  ...m of <tt>M</tt> mod <tt>P</tt> and the components of <tt>M</tt> must be of type <tt>INT</tt>. ...given, the components of M must be of type INT. Otherwise, they must be of type ZMOD.</item>
  3 KB (452 words) - 10:09, 7 October 2020
• ApCoCoA-1:GLPK.LPMax
  ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>
  2 KB (259 words) - 15:05, 1 November 2020
• ApCoCoA-1:Examples Tutorial De Euklid
  If Type(A)<>INT OR Type(B)<>INT Then
  1 KB (218 words) - 20:13, 17 July 2008
• CoCoA:GB.Stats
  <short_description>status of an interactive Groebner-type calculation</short_description> <type>groebner</type>
  618 bytes (75 words) - 10:02, 24 October 2007
• CoCoA:IsNumber
  This function returns TRUE if E has type INT, RAT, or ZMOD. <type>boolean</type>
  627 bytes (73 words) - 10:02, 24 October 2007
• Package glpk/GLPK.LPMax
  ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>poly</type>
  2 KB (275 words) - 15:30, 1 November 2020
• CoCoA:GB.Step
  <short_description>take one step in an interactive Groebner-type calculation</short_description> <type>groebner</type>
  589 bytes (74 words) - 10:02, 24 October 2007
• CoCoA:GB.Steps
  <short_description>take steps in an interactive Groebner-type calculation</short_description> <type>groebner</type>
  595 bytes (75 words) - 10:02, 24 October 2007
• CoCoA:Pfaffian
  where M is skew-symmetric. The resulting type depends on the entries <type>matrix</type>
  519 bytes (65 words) - 10:02, 24 October 2007
• ApCoCoA-1:LinAlg.REF
  ...m of <tt>M</tt> mod <tt>P</tt> and the components of <tt>M</tt> must be of type <tt>INT</tt>. ...t>M</tt> must be of type <tt>INT</tt>. Otherwise, they must be castable to type <tt>RAT</tt> or <tt>ZMOD</tt> (please see description above).</item>
  4 KB (566 words) - 13:33, 29 October 2020
• ApCoCoA-1:GLPK.MIPMin
  ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>
  2 KB (308 words) - 15:17, 1 November 2020
• ApCoCoA-1:GLPK.MIPMax
  ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>
  2 KB (308 words) - 15:14, 1 November 2020
• CoCoA:Error
  If Type(N) &lt;&gt; INT Then Error(<quotes>Argument must be an integer.</quotes>) E <type>error</type>
  770 bytes (95 words) - 10:02, 24 October 2007
• CoCoA:IsZero
  of almost any type for which <em>zero</em> makes sense. <type>boolean</type>
  959 bytes (112 words) - 10:02, 24 October 2007
• Package glpk/GLPK.LPMin
  ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>list</type>
  2 KB (298 words) - 15:31, 1 November 2020
• ApCoCoA-1:IML.Solve
  <item>@param <em>M</em> A matrix with components either of type INT, ZMOD or RAT.</item> <item>@param <em>B</em> A matrix with components either of type INT, ZMOD or RAT.</item>
  2 KB (292 words) - 10:09, 7 October 2020

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)