Tag: exp-time-algorithms

Found 29 results for 'exp-time-algorithms'.

---

1) ds.algorithms - What is the fastest known algorithm for computing a 1.99-approximation of Vertex Cover?
2) cc.complexity-theory - Computational Model in SETH
3) ds.algorithms - NP-hard problems with very fast exponential-time algorithms
4) ds.algorithms - Reference request: complexity of $k$-partite $k$-SAT
5) time-complexity - Examples of problems where exponential algorithms run faster than polynomial algorithms for practical sizes?
6) ds.algorithms - Exact algorithms for non-convex quadratic programming
7) cc.complexity-theory - Complexity of validity problem for Monadic First Order Logic?
8) ds.algorithms - Finding cliques in a big graph
9) graph-theory - How many distinct colors are needed to lower-bound the choosability of a graph?
10) cc.complexity-theory - Question on deduction that a certain problem requires exponential space
11) exp-time-algorithms - The problem of deciding whether a monotone CNF implies a monotone DNF
12) np-hardness - Exact exponential-time algorithms for 0-1 programming
13) reference-request - Two DFA intersection emptiness connections to SETH & L vs P
14) ds.algorithms - Pseudo-polynomial time algorithms
15) cc.complexity-theory - Approximation algorithms for Metric TSP
16) ds.algorithms - Time complexity of Held-Karp algorithm for TSP
17) quantum-computing - Do any quantum algorithms improve on classical SAT?
18) exp-time-algorithms - EXP-Complete Problems vs Subexponential Algorithms
19) cc.complexity-theory - Learning about EXPTIME and EXPSPACE
20) cc.complexity-theory - Oracle comparing $EXP$ with $UP$
21) cc.complexity-theory - Solving Superstring Exactly
22) randomized-algorithms - Correctness of AKS algorithm for shortest vector problem
23) ds.algorithms - What is the worst-case runtime complexity to transform a NFA to DFA via Rabin-Scott's power set construction?
24) cc.complexity-theory - Consequences of faster parameterized integer programming
25) ds.algorithms - Examples of $2^{\Theta(n^2)}\text{poly}(n)$-time algorithms
26) reference-request - Is there a W[1]-hard problem that can be solved in $2^{o(n)}$ time?
27) time-complexity - Example of context-free grammar that triggers exponential behaviour without memoization in RD parsers
28) sat - $\overline{SAT} \in NTIME(subexp)$?
29) cc.complexity-theory - Best known algorithm for NEXP-complete problem

---