On genuinely time bounded computations (Q5096139): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of computations with the floor function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for solving linear diophantine equations on random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating probabilistic by deterministic algebraic computation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Betti Numbers of Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimality of Some Set Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Komplexität von Entscheidungsproblemen. Ein Seminar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berechnung und Programm. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for algebraic decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank

Latest revision as of 21:14, 29 July 2024

scientific article; zbMATH DE number 7571912
Language Label Description Also known as
English
On genuinely time bounded computations
scientific article; zbMATH DE number 7571912

    Statements

    On genuinely time bounded computations (English)
    0 references
    0 references
    16 August 2022
    0 references
    arithmetic operation
    0 references
    knapsack problem
    0 references
    arithmetic progression
    0 references
    random access machine
    0 references
    Presburger arithmetic
    0 references

    Identifiers