Pages that link to "Item:Q1604206"
From MaRDI portal
The following pages link to Which problems have strongly exponential complexity? (Q1604206):
Displaying 50 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Efficiently approximating color-spanning balls (Q284593) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Parameterized proof complexity (Q451111) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
