Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

  7. current community

    your communities

    more stack exchange communities

    company blog
Theoretical Computer Science

Help Center > Badges > Scholar

 Scholar
Ask a question and accept an answer.
Awarded 2201 times.
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
Intersection of a recognizable language and a decidable language is decidable? [migrated]
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
Machine Learning Algorithm To Fill Data Holes
Awarded Apr 26 at 17:40
Longest stack-sortable subsequence
Awarded Apr 24 at 3:35
Is there a relation between BBH (black box hypothesis) and SETH (strong exponential time hypothesis)?
Awarded Apr 22 at 12:20
Densest k subgraph problem for outerplanar graphs?
Awarded Apr 21 at 0:40
Examples of nontrivial non-discriminatory functions
Awarded Apr 16 at 14:35
Estimating inner product over $[r]^d$
Awarded Apr 15 at 19:30
String theory based computations
Awarded Apr 12 at 13:25
Number of simple paths between two vertices in a DAG
Awarded Apr 11 at 1:30
What logic correponds via Curry-Howard to a Monad?
Awarded Apr 10 at 19:35
If I know pretty well '(a,b)', I know pretty well 'a', or 'b', or 'a xor b'
Awarded Apr 8 at 7:10
Classic Neural Network Layout for regression: is the score function derivable?
Awarded Apr 4 at 19:40
Differences in the requirements for different bit architectures [closed]
Awarded Apr 4 at 18:40
Compactness of domino tilings
Awarded Apr 1 at 7:05
How small can extension complexity be?
Awarded Mar 30 at 21:15
Extending Hindley-Milner to type mutable references
Awarded Mar 20 at 16:05
Universe polymorphism: the inference of universes and their constraints
Awarded Mar 15 at 16:15
Subset sum problem with at most one solution for any target
Awarded Mar 9 at 19:55
3 dimensional matching shortest solution NP-hard?
Awarded Mar 8 at 11:30
How to generalize VC dimension?
Awarded Mar 8 at 2:10
Auction theory - Selling Multiple Items via Social Networks
Awarded Mar 7 at 22:00
Data Strcuture to represent dependencies amongst modules
Awarded Mar 7 at 14:55
Dependent C-style types with subtyping rule
Awarded Mar 2 at 9:05
How to tell if an effect is algebraic?
Awarded Feb 27 at 19:05
Does fixed hyperparameters perform well regardless the number of training examples?
Awarded Feb 26 at 11:50
List of quantum-inspired algorithms
Awarded Feb 22 at 15:55
Bi-criteria combinatorial approximation algorithms for min k-vertex cover
Awarded Feb 21 at 15:50
Is F<: with bottom undecidable?
Awarded Feb 19 at 23:50
What is the reference for the proof Gödel's first incompleteness theorem based on the undecidability of the halting problem?
Awarded Feb 19 at 17:05
Lower bound of real valued bounded function
Awarded Feb 19 at 15:10
Solving Feedback Vertex Set (FVS) in FPT time $5^k$ with iterative compression?
Awarded Feb 17 at 15:50
An equation relating Time complexity, Space complexity, and entropy of output
Awarded Feb 10 at 20:50
Does P^NP=NP imply NP=coNP? [closed]
Awarded Feb 8 at 5:35
Would an NP-complete public key cryptosystem imply NP=co-NP?
Awarded Feb 6 at 20:55
Validity of a modal argument about “vagueness”
Awarded Feb 4 at 17:55
Is S-T CONNECTEDNESS #P-complete on instances when all s-t paths are of the same length?
Awarded Jan 21 at 11:20
Do Turing complete languages automatically have efficient algorithms [closed]
Awarded Jan 13 at 6:35
Why can't a left-recursive, non-deterministic, or ambiguous grammar be LL(1)?
Awarded Jan 12 at 22:40
Fast Finding Main Diagonal of Matrix Multiplication
Awarded Jan 7 at 11:00
Does every online algorithm has an offline counterpart?
Awarded Jan 6 at 17:10
Is a binary sequence computable iff the Kolmogorov complexity of its initial segments is bounded?
Awarded Jan 4 at 17:25
Why is the “general notion of a reduction […] inherent to the notion of self-reducibility”?
Awarded Jan 4 at 8:25
Does a given regular language contain an infinite prefix-free subset?
Awarded Jan 3 at 10:15
1 2 3 4 5 … 37