A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.
Theoretical Computer Science

Help Center > Badges > Promoter

 Promoter
First bounty you offer on your own question.
Awarded 208 times.
NP-hard problems with very fast exponential-time algorithms
Awarded Dec 29 '19 at 16:40
$NP$-Completeness of $\epsilon$-balanced graph partitioning for fixed $\epsilon$
Awarded Dec 13 '19 at 15:20
What are some examples of algorithmic applications of noncommutative rational identity testing?
Awarded Dec 2 '19 at 17:25
Can we map this problem to subset-sum?
Awarded Jul 16 '19 at 11:25
Run Length eXtreme encoded length
Awarded Jul 15 '19 at 16:55
A dynamic data structure to list triangles
Awarded Jul 1 '19 at 8:10
Planar Exact Cover by even-size sets
Awarded Jun 24 '19 at 12:35
What type of mathematical problems interesting for TCS researchers?
Awarded Mar 27 '19 at 17:05
Reference request: exponential growth rates of subsequence-closed languages are integers
Awarded Mar 9 '19 at 19:30
A partition problem in which some numbers may be cut
Awarded Feb 2 '19 at 22:40
Is case analysis on normal forms of lambda terms sufficient to prove parametricity results?
Awarded Jan 28 '19 at 18:30
A least sized partition of a set under a distance metric
Awarded Nov 12 '18 at 17:25
Time complexity of exponentiating s-sparse matrices
Awarded Nov 6 '18 at 18:20
Confusion about a formal definition of PRAM consistency
Awarded Aug 24 '18 at 11:50
Algorithmic mutual information between random string and minimal Kolmogorov sufficient statistic
Awarded Jul 3 '18 at 10:08
List of (unsolved) complexity problems arising from PL
Awarded Apr 11 '18 at 0:19
Can we find a generic tight example for the greedy algorithm of the unweighted generalized assignment problem?
Awarded Apr 8 '18 at 0:28
Realization of a bipolar orientation by a mixed graph
Awarded Mar 23 '18 at 22:48
(post deleted or otherwise unavailable)
Awarded Jan 16 '18 at 22:25
Is Non-linear Constrained Optimal Exact Cover NP-Hard?
Awarded Jan 12 '18 at 17:22
Visualizing the parse structure of a range concatenation grammar
Awarded Dec 29 '17 at 22:50
Reference Request: complexity results on finding $(1+\epsilon) \log n$ size clique in $G(n,1/2)$
Awarded Dec 4 '17 at 20:17
Examples of quasilinear vs. essentially linear time translatable models
Awarded Nov 23 '17 at 17:44
Program inversion algorithms for higher-order programs
Awarded Nov 13 '17 at 11:44
Bloom filter variant for constant-time subset/superset queries
Awarded Oct 31 '17 at 15:54
Bipartite matching with degree domination
Awarded Oct 2 '17 at 18:59
Deciding the Most Significant Bit of Binary Multiplication
Awarded Sep 9 '17 at 17:48
Graph rewriting with one-to-many pattern matching?
Awarded Jun 22 '17 at 2:42
Approximating the Radius of a (Dense) Graph
Awarded Jun 17 '17 at 14:52
Pumping Lemma over 2 way Automaton
Awarded Jun 9 '17 at 6:20
Does there exist an oracle $A$ such that $(P^{\#P})^{A} \neq PSPACE^{A}$?
Awarded Apr 29 '17 at 20:27
When can be used the “uncompute garbage” trick in quantum computing?
Awarded Apr 26 '17 at 5:29
Is graph automorphism Karp-reducible to graph isomorphism under hidden subgroup representation?
Awarded Mar 1 '17 at 2:22
A subset grouping problem
Awarded Feb 10 '17 at 23:21
(post deleted or otherwise unavailable)
Awarded Feb 7 '17 at 22:01
How can non-terminating $\lambda$-terms be turned into fixed-point combinators?
Awarded Nov 5 '16 at 14:59
Constructing subfields of a finite field
Awarded Oct 23 '16 at 22:12
(post deleted or otherwise unavailable)
Awarded Oct 23 '16 at 14:24
Context-Sensitive Grammar characteristic properties
Awarded Oct 22 '16 at 12:58
Minimum-weight feedback edge set in undirected graph - how to find it? Is it NP hard problem?
Awarded Jul 23 '16 at 13:15
algorithms for a large submatrix / general factor / quasi-biclique problem?
Awarded Jul 8 '16 at 21:06
reference request: deciding validity of higher-order quantified boolean formulas is not Kalmar-elementary
Awarded Jun 13 '16 at 16:12
Can every distribution producible by a probabilistic PSpace machine be produced by a PSpace machine with only polynomially many random bits?
Awarded Jun 6 '16 at 12:14
Number of ordinal trees with n nodes, of depth d, with l leaves
Awarded May 31 '16 at 14:39
Vertex Disjoint Path Covers of Hypercube-Like Graphs
Awarded May 12 '16 at 18:47
theorems for universal set of quantum gates for SU(d)
Awarded May 11 '16 at 4:22
How to generate Extended Finite State Machines Randomly with some properties?
Awarded Apr 29 '16 at 7:32
On FFT and trigonometric matrix eigenvalues
Awarded Feb 18 '16 at 22:11
Complexity of approximating the range of a matrix
Awarded Jan 30 '16 at 17:47
(post deleted or otherwise unavailable)
Awarded Jan 21 '16 at 8:24
Submatrix of small rank
Awarded Nov 22 '15 at 8:59
Min Hamming distance of a given string from substrings of another string
Awarded Nov 19 '15 at 12:21
Complexity of counting spanning subgraphs that have cycle properties
Awarded Nov 14 '15 at 22:54
Canonical representation of Binary Decision Tree in Ptime?
Awarded Nov 11 '15 at 21:31
Is the computation of a minimal correction subset (MCS) $FP^{NP}$-hard?
Awarded Sep 27 '15 at 17:18
Is it possible to boost the error probability of a Consensus protocol over dynamic network?
Awarded Sep 4 '15 at 3:40
Graph coloring/partitioning problem
Awarded Aug 30 '15 at 18:37
Convex hull of polytopes
Awarded Aug 17 '15 at 7:17
What is the application of combinatorial game theory
Awarded Aug 17 '15 at 3:13
Integer multiplication when one integer is fixed
Awarded Aug 16 '15 at 13:26
1 2 3 4