Back to Results
First PageMeta Content
Differential geometry / Affine geometry / Affine transformation / Transformation / Jet / Vector space / Divisor / Affine connection / Affine focal set / Algebra / Geometry / Mathematics


INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Bounding the Computational Complexity of Flowchart Programs with Multi-dimensional Rankings Christophe Alias — Alain Darte — Paul Feautrier — Laure
Add to Reading List

Document Date: 2010-04-20 13:00:22


Open Document

File Size: 360,04 KB

Share Result on Facebook

Continent

Europe / /

Facility

Lille University Centre / /

IndustryTerm

recursive algorithm / external tool / conservative solutions / partial solutions / exhaustive search / /

Organization

ENS Lyon Research / Lille University Centre / INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Bounding / /

Person

Laure Gonnord / Paul Feautrier / Alain Darte / /

/

Position

guard / INRIA Researcher CNRS Researcher Professor / affine guard / Invariants The guard / Assistant / /

ProgrammingLanguage

C / K / /

Technology

Our algorithm / same algorithm / recursive algorithm / ranking algorithm / /

SocialTag