„Polynomial Time Complexity“
Suchergebnisse
1.000+ Treffer
-
Combinatorial Optimization and Graph Algorithms – Communications of NII Shonan Meetings
-
On the Complexity of Secluded Path Problems
-
Capturing Polynomial Time and Logarithmic Space using Modular Decompositions and Limited Recursion
-
Constrained Outer-String Representations
-
Finite Model Theory and Proof Complexity Revisited – Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
-
Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components
-
$$(k,n-k)$$ (k,n-k) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O∗(2p) -Time Algorithm and a Polynomial Kernel
-
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming
-
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
-
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
-
On the Complexity Landscape of Connected f-Factor Problems
-
Constrained Outer-String Representations
-
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
-
Computational Complexity of Matching Match Puzzle
-
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs
-
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics
-
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
-
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
-
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits
-
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