Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New Computational Paradigms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A flow calculus of <i>mwp</i> -bounds for complexity analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational complexity of imperative programming languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs / rank | |||
Normal rank | |||
Latest revision as of 11:23, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time |
scientific article |
Statements
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (English)
0 references
19 June 2008
0 references
implicit computational complexity
0 references
polynomial time complexity
0 references
linear time complexity
0 references
static program analysis
0 references
