Ulrich complexity (Q1679674): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q115355374 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Macaulay2 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.difgeo.2017.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243135254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the determinantal complexity of a hypersurface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinantal hypersurfaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ulrich bundles on abelian surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally generated Cohen-Macaulay modules. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cohen-Macaulay modules on hypersurface singularities. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizing of n-ic forms and generalized Clifford algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological Algebra on a Complete Intersection, with an Application to Group Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betti numbers of graded modules and cohomology of vector bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resultants and Chow forms via exterior syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5318419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear maximal Cohen-Macaulay modules over strict complete intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cohen-Macaulay modules on hypersurface singularities. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4661386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits: A survey of recent results and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gorenstein rings and modules with high numbers of generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:01, 14 July 2024

scientific article
Language Label Description Also known as
English
Ulrich complexity
scientific article

    Statements

    Ulrich complexity (English)
    0 references
    0 references
    0 references
    0 references
    21 November 2017
    0 references
    0 references
    Ulrich modules
    0 references
    complexity of computation
    0 references
    permanents
    0 references
    0 references
    0 references