Tag: lower-bounds


Found 120 results for 'lower-bounds'.


1) graph-theory - How many disjoint edge-cuts a DAG must have?
2) ds.data-structures - How fast can we find and disconnect roots in a forest?
3) cc.complexity-theory - Most efficient way to convert an $\text{AC}^0$ circuit to a circuit (of any depth) with gate fanout 1
4) ds.algorithms - Nontrivial algorithm for computing a sliding window median
5) cc.complexity-theory - Communication complexity of Independent Set game?
6) ds.algorithms - Hardness of Subgraph isomorphism problem for sparse pattern graph
7) ds.algorithms - Reference request: complexity of $k$-partite $k$-SAT
8) ds.algorithms - Mergeable Exact Order Statistics Data Structure
9) reference-request - Lower bounds on the size of CFGs for specific finite languages
10) cc.complexity-theory - Lower bounds for learning in the membership query and counterexample model
11) cc.complexity-theory - Fourier coefficients Boolean Functions described by Bounded Depth Circuits with AND OR and XOR gates
12) graph-theory - Counting xyz-graphs in $\mathbb{Z}_n^3$
13) cc.complexity-theory - Is it known whether hypergraph minimal covers are P-enumerable?
14) ds.algorithms - Divide and Conquer Algorithm for 1-Median Problem
15) cc.complexity-theory - How does the Mulmuley-Sohoni geometric approach to producing lower bounds avoid producing natural proofs (in the Razborov-Rudich sense)?
16) lower-bounds - Application of weak determinantal identities to GCT?
17) cc.complexity-theory - Separating Logspace from Polynomial time
18) cc.complexity-theory - Lower bounds for constant-depth formulae?
19) cc.complexity-theory - Formula size lower bounds for AC0 functions
20) lower-bounds - Circuit lower bounds over arbitrary sets of gates
21) cc.complexity-theory - Are arithmetic circuits weaker than boolean?
22) cc.complexity-theory - Best current space lower bound for SAT?
23) automata-theory - 2DFA that requires many states in equivalent DFA?
24) cc.complexity-theory - Subset Sum bounds
25) cc.complexity-theory - Are there more polynomial time problems with complexity lower bounds?
26) cc.complexity-theory - Highest lower bound on NP problems (TSP)
27) cc.complexity-theory - Is the Kolmogorov complexity of the truth tables of the halting problem known asymptotically?
28) cc.complexity-theory - Problem in deterministic time $n^p$ and not lower
29) cc.complexity-theory - Proving lower bounds by proving upper bounds
30) cc.complexity-theory - What are the current best known upper and lower bounds on the (un)satisfiability threshold for random k-sat and/or 3-sat?
31) cc.complexity-theory - How can I show a Gap-P problem is outside #P
32) approximation-algorithms - How can we bound the optimal solution of the dual bin packing when we solve the knapsack problem for each bin?
33) lower-bounds - Lower bounds on alternative models of multiparty communication complexity
34) ds.algorithms - Showing that interval-sum queries on a binary array can not be done using linear space and constant time
35) ds.algorithms - Lower bounds for inversion counting in comparison model?
36) cc.complexity-theory - Complexity lower bound: the gap between decision trees and RAMs
37) ds.algorithms - Functions and Counting Problems in Streaming Computation
38) cc.complexity-theory - Why does deterministic recognition of DYCK(2) languages in the streaming model take linear space?
39) lower-bounds - Lower bound proof for compressive sensing (Gel'fand widths)?
40) ds.data-structures - Lower Bounds for Data Structures
41) graph-theory - Which problems in computational geometry or graph theory are believed to be $\Omega(n^3)$?
42) graph-theory - Lower bound on the largest restrained cubic subset
43) cc.complexity-theory - Lower bounds on the Threshold function
44) cc.complexity-theory - (0,1)-vector XOR problem
45) fl.formal-languages - Maximum shortest word accepted by pushdown automata
46) cc.complexity-theory - References on Circuit Lower Bounds
47) cc.complexity-theory - Razborov's Approximation methods
48) cc.complexity-theory - Lower bounds on Gaussian complexity
49) cc.complexity-theory - How many negations do we need to compute monotone functions?
50) co.combinatorics - Number of different longest common substrings