„Time Complexity“
Suchergebnisse
1.161 Treffer
-
10441 Abstracts Collection – Exact Complexity of NP-hard Problems
-
10071 Abstracts Collection – Scheduling
-
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
-
Light Reading: Optimizing Reader/Writer Locking for Read-Dominant Real-Time Workloads (Artifact)
-
Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision
-
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False
-
Single Machine Scheduling with Few Deadlines
-
Bias Reduction for Sum Estimation
-
SparseRNAFolD: Sparse RNA Pseudoknot-Free Folding Including Dangles
-
On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages
-
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits
-
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric
-
A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEs
-
Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality
-
Cumulative Memory Lower Bounds for Randomized and Quantum Computation
-
Towards Efficient Explainability of Schedulability Properties in Real-Time Systems
-
Finding a Maximum Clique in a Disk Graph
-
The Pathological Complexity of Stroke and Rational Treatment Principles of Chinese Herbal Medicine
-
An ??(3.82^k) Time FPT Algorithm for Convex Flip Distance
-
Non-Uniform Complexity via Non-Wellfounded Proofs