We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science

Help Center > Badges > Scholar

 Scholar
Ask a question and accept an answer.
Awarded 2242 times.
State of research on SHA-1 Collision Attacks
Awarded 2 days ago
Which complexity class does this problem belong to?
Awarded Nov 10 at 10:55
Why NL is not L
Awarded Nov 9 at 1:05
Example of decidable NP-hard problem that is not NP-complete [closed]
Awarded Nov 8 at 23:55
Is the isomorphism problem between posets represented by DAGs GI-complete?
Awarded Nov 7 at 1:00
Are there common names for the subtiers of PTIME?
Awarded Nov 2 at 0:50
How to efficiently read the theoretical computer science research papers?
Awarded Oct 31 at 6:00
What languages can be reduced to a NP-complete problem in polynomial time
Awarded Oct 29 at 9:00
Maximization of Mutual Information
Awarded Oct 27 at 16:10
Computing the edge orbits of a graph (and discussing definitions)
Awarded Oct 25 at 9:00
Is the Chi-square divergence a Bregman divergence?
Awarded Oct 15 at 13:45
Re-packing of integers into fixed-size bins
Awarded Oct 13 at 21:10
How tight is the XOR lemma?
Awarded Oct 11 at 23:45
Complexity of SAT parameterized by treewidth
Awarded Oct 9 at 22:20
What class of languages is recognized by finite-state automata with $k$ heads?
Awarded Oct 8 at 0:05
What's the point of stack judgement in CBPV?
Awarded Oct 7 at 20:15
Obtaining the Axiom of Choice through a modality in HTT
Awarded Sep 29 at 2:30
Can we have more than one Deterministic Finite Automata diagrams for a set of strings? [closed]
Awarded Sep 25 at 16:55
Efficient randomness reduction using k-wise independence
Awarded Sep 25 at 3:20
Optimalization of sum $f(x_i, x_j)$ for all $i < j$ pairs through permutation only?
Awarded Sep 24 at 9:25
Dividing a complete graph into two cliques with maximal sum of edge weights
Awarded Sep 23 at 22:55
Reconstruction of a sequence generated by a Markov chain - reference request
Awarded Sep 20 at 7:45
Satisfiability problems with restricted (not bounded) number of occurrences per variable
Awarded Sep 11 at 14:35
Why is differential privacy defined over the exponential function?
Awarded Sep 10 at 1:05
About a pre-processing step for primal–dual weighted set cover problem
Awarded Sep 5 at 1:25
What is a natural problem in theory of computation?
Awarded Aug 29 at 3:10
Does $\exists\mathbb{R}=\mathbf{PSPACE}$?
Awarded Aug 28 at 19:35
3-coloring planar graphs in $O\left(3^{n^.5}\right)$?
Awarded Aug 20 at 21:45
Hospital Resident Matching Algorithm with Incomplete Preferences
Awarded Aug 18 at 22:30
Hardness of LWE on not-uniform vector samples
Awarded Aug 18 at 12:00
Are there digraphs such that any two arborescences are arc-disjoint?
Awarded Aug 9 at 4:50
The asymptotic behavior of a recurrence related to stable matchings
Awarded Aug 8 at 17:25
DPDA with parameterized states
Awarded Aug 3 at 17:00
What is the formal definition of a stacked based finite state machine?
Awarded Jul 22 at 12:30
Efficient graph isomorphism for similar graph queries
Awarded Jul 18 at 0:55
Separation of AM and SZK
Awarded Jul 15 at 17:00
Given a subset of the hypercube and a copy translated by s, find s
Awarded Jul 13 at 5:40
Partially persistent linked list data structure: would lookup of the first element at a specific version be O(|versions|) and not O(1)?
Awarded Jul 9 at 18:25
Big-O bounds on the k-th largest element of iid Gaussians
Awarded Jun 28 at 17:05
What is the relation/difference between axiomatic and denotational semantics one one side, and the data flow analysis(DFA) on the other sied?
Awarded Jun 26 at 16:35
Upper bounds on the circut depth
Awarded Jun 25 at 18:30
Complexity of Finding Largest Set of Intersecting Convex Polytopes
Awarded Jun 23 at 11:00
How do continuations represent negations (under the Curry–Howard correspondence)?
Awarded Jun 14 at 14:15
Can three stacks be implemented in one array, with O(1) push/pop time?
Awarded Jun 13 at 5:50
Why not include private randomness in internal communication information definition?
Awarded Jun 12 at 5:45
Min Cut with Vertices
Awarded Jun 6 at 12:45
Attempted proofs of P vs NP
Awarded Jun 3 at 8:00
(post deleted or otherwise unavailable)
Awarded Jun 2 at 10:10
Why colon to denote that a value belongs to a type?
Awarded May 29 at 19:15
Comprehensive list of functions used in Big-$O$ notation
Awarded May 25 at 15:35
Axioms of Minimum Size Resolution Refutations
Awarded May 21 at 22:10
Graph path problem [duplicate]
Awarded May 21 at 11:00
Is there any quantum analog of the VP vs. VNP problem?
Awarded May 19 at 18:40
Understanding the Beck-Chevalley Condition
Awarded May 18 at 19:05
Finding a Hamiltonian cycle from perfect matching of a bipartite graph
Awarded May 17 at 7:25
Uniqueness of the distribution maximizing the channel capacity
Awarded May 11 at 11:10
What was the significance of Leslie Valiant's, “A Theory of the Learnable?”
Awarded May 6 at 1:00
In external memory, is grouping equal elements easier than sorting?
Awarded May 3 at 18:50
Finding the maximum no. of people who get along in a group [closed]
Awarded Apr 29 at 5:00
Turing Machines as Coalgebras
Awarded Apr 26 at 19:35
1 2 3 4 5 … 38