Tag: time-complexity

Found 163 results for 'time-complexity'.

1) python - How do I profile a Python script?
2) javascript - How do I check if an array includes a value in JavaScript?
3) python - Runtime of python's if substring in string
4) algorithm - What does O(log n) mean exactly?
5) algorithm - How can I find the time complexity of an algorithm?
6) python - 'in' operator functionality in python
7) c++ - Why is Ruby string handling very slow?
8) ds.algorithms - What is the initialization time of a link-cut tree?
9) reference-request - Is counting simple cycles in $P$ for graphs of bounded tree width?
10) cc.complexity-theory - Gaussian Elimination in terms of Group Action
11) cc.complexity-theory - Generalized Geography on graphs of bounded treewidth
12) cc.complexity-theory - How can you prove that a problem is not solvable in a certain time complexity?
13) time-complexity - Examples of problems where exponential algorithms run faster than polynomial algorithms for practical sizes?
14) graph-algorithms - Efficient all pair bottleneck computation for a tree
15) reference-request - Complexity of #SAT for monotone DNF formulae whose hypergraph is a hypertree
16) reference-request - Can one automate algorithmic analysis?
17) cc.complexity-theory - Trade off between time and query complexity
18) graph-theory - Complexity of finding semi-ordered Eulerian tours in a 4-regular graph
19) ds.algorithms - Task Multithreading analysis for a Divide and Conquer algorithm
20) time-complexity - Complexity of unbalanced bipartite isomorphism
21) approximation-algorithms - The complexity of finding a Borsuk-Ulam point
22) ds.algorithms - Minimum length walk from s to t covering a subset of vertices
23) ds.algorithms - Fastest known algorithm for finding simple paths through given set of vertices
24) cc.complexity-theory - Can emptiness of reversal-bounded counter languages be decided in time polynomial to the number of counters?
25) cc.complexity-theory - How much time to recognize palindromes in logarithmic space?
26) cc.complexity-theory - Subset Sum bounds
27) cc.complexity-theory - Do runtimes for P require EXP resources to upper-bound? … are concrete examples known? (answer: yes and yes)
28) cc.complexity-theory - Are there more polynomial time problems with complexity lower bounds?
29) cc.complexity-theory - Optimal NP solvers
30) cc.complexity-theory - Implication of solving 3SUM problem of a certain size on the Exponential Time Hypothesis
31) time-complexity - What are those deterministic algorithms for k-SAT that are not derandomization of random algorithms like PPSZ and Schöning's local search?
32) cc.complexity-theory - Does $∩_{ε>0} \mathrm{DTIME}(O(n^{2+ε})) = \mathrm{DTIME}(n^{2+o(1)})$?
33) cc.complexity-theory - Is $\mathsf{DTIME}(n) = \mathsf{DTIME}(2n)$?
34) cc.complexity-theory - Problem in deterministic time $n^p$ and not lower
35) cc.complexity-theory - Is this language recognizable by a 3 symbols TM in O(n log n)?
36) cc.complexity-theory - When studying the computational complexity of functions $\{0, 1\}^\ast \to \{0, 1\}^\ast$, is it enough to restrict to $\{0, 1\}^\ast \to \{0, 1\}$?
37) ds.algorithms - What is the fastest algorithm to compute rank of a rectangular matrix?
38) time-complexity - state-of-the-art bit complexity of the determinant
39) ds.algorithms - Complexity of Membership-Testing for finite abelian groups
40) ds.algorithms - Complexity of computing the discrete Fourier transform?
41) cc.complexity-theory - Different definitions of complexity
42) cc.complexity-theory - $\mathsf{DTime}(O(n^k)) \subseteq \mathsf{NTime}(g)$ for some $g \in o(n^k)$?
43) time-complexity - Number of SAT checks that are needed to find all combinations of subset of boolean variables of a propositional formula
44) cc.complexity-theory - NEXPTIME-completeness with more time for reductions
45) cc.complexity-theory - Can you decide equivalence for monotone Boolean expressions that do not contain negation in PTIME?
46) cc.complexity-theory - ${\bf NP} \not = {\bf E}$ and ${\bf PSPACE} \not = {\bf E}$
47) reference-request - Runtime of Grover's algorithm
48) cc.complexity-theory - How "hard" is it to maximize a polynomial function subject to linear constraints?
49) computability - To what extent can an algorithm predict the time complexity an arbitrary input program?
50) cc.complexity-theory - Quanitifier Free Presburger Arithmetic: Upper bound on solution size?