Tight Worst-Case Bounds for Polynomial Loop Programs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-17127-8_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Tight Performance Bounds in the Worst-Case Analysis of Feed-Forward Networks

Discrete Event Dynamic Systems: Theory and Applications
ControlElectronic EngineeringSystems EngineeringSimulationElectricalModeling
2015English

Structural Graph Matching With Polynomial Bounds on Memory and on Worst-Case Effort

2004English

On Domain-Partitioning Induction Criteria: Worst-Case Bounds for the Worst-Case Based

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1974English

Worst-Case Large Deviations Upper Bounds for i.i.d. Sequencesunder Ambiguity

Turkish Journal of Mathematics
Mathematics
2018English

Tight Bounds for Adopt-Commit Objects

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Tight Bounds for Parallel Randomized Load Balancing

2011English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy