Stack Exchange Network

Stack Exchange network consists of 174 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 > Editor

 Editor
First edit.
Awarded 3356 times
Model of computation where each space in memory can store an arbitrary large integer
Awarded 2 hours ago
Is minimum makespan schedule for this problem known to be NP-hard?
Awarded 2 days ago
Best way to determine if a list of bytes are random?
Awarded Jan 15 at 15:00
Algebraic construction of $\varepsilon$-biased sets
Awarded Jan 15 at 10:55
Can I prove this polynomial reduction?
Awarded Jan 14 at 0:30
Do Turing complete languages automatically have efficient algorithms
Awarded Jan 13 at 6:45
Complexity of a matrix problem
Awarded Jan 10 at 17:35
maximize edges minus vertices in a weighted graph
Awarded Jan 7 at 16:55
Algorithm for K-best NON perfect bipartite matchings
Awarded Jan 7 at 12:05
Decomposition for a certain class of graphs
Awarded Jan 7 at 6:55
Why can't a left-recursive, non-deterministic, or ambiguous grammar be LL(1)?
Awarded Jan 6 at 20:00
NuSMV - How to indicate the execution should visit some states infinitely often?
Awarded Jan 6 at 6:30
What to do as a Theoretical computer science PhD student in a free time?
Awarded Jan 5 at 18:35
Consequences of Complete problems for NP intersects coNP
Awarded Jan 4 at 23:15
Strong seeded randomness extractors with low entropy loss
Awarded Jan 2 at 17:15
What CS blogs should everyone read?
Awarded Jan 1 at 10:10
Hardness jumps in computational complexity?
Awarded Dec 31 '18 at 18:05
Is a binary sequence computable iff the Kolmogorov complexity of its initial segments is bounded?
Awarded Dec 31 '18 at 11:20
Is this paper proposing to study uncomputable simulations?
Awarded Dec 29 '18 at 19:00
Does a given regular language contain an infinite prefix-free subset?
Awarded Dec 27 '18 at 15:10
Evaluating addition chains
Awarded Dec 27 '18 at 1:50
Does BQP contain any NP-Complete problem?
Awarded Dec 23 '18 at 13:35
Is this a knapsack problem?
Awarded Dec 19 '18 at 9:20
(post deleted or otherwise unavailable)
Awarded Dec 18 '18 at 0:05
Complexity of low-rank matrix factorizations with rows in a simplex and outliers
Awarded Dec 17 '18 at 22:50
Internal information is at most expected number of bits
Awarded Dec 17 '18 at 9:05
A total language that only a Turing complete language can interpret
Awarded Dec 16 '18 at 12:20
Formally prove that the loops of this sorting algorithm will terminate
Awarded Dec 15 '18 at 18:25
(post deleted or otherwise unavailable)
Awarded Dec 11 '18 at 7:40
Is getting post-doc difficult in theoretical computer science with few published papers? [closed]
Awarded Dec 10 '18 at 6:50
Is compiler for dependent type much harder than an intepreter?
Awarded Dec 4 '18 at 11:25
Impartial Combinatorial Games as a core of the final undergraduate project
Awarded Dec 1 '18 at 19:00
Ordering tours in a Euclidean TSP according to (strictly) increasing length
Awarded Dec 1 '18 at 18:55
Graduate school for CS theory?
Awarded Nov 30 '18 at 20:55
(post deleted or otherwise unavailable)
Awarded Nov 30 '18 at 14:30
(post deleted or otherwise unavailable)
Awarded Nov 30 '18 at 10:00
Are all turing machines paths predictable?
Awarded Nov 28 '18 at 20:55
Problems Between P and NPC
Awarded Nov 27 '18 at 12:20
(post deleted or otherwise unavailable)
Awarded Nov 26 '18 at 21:40
(post deleted or otherwise unavailable)
Awarded Nov 23 '18 at 13:15
Hereditary substitution with a universe hierarchy
Awarded Nov 23 '18 at 9:40
Isolation in Turing-complete reversible cellular automata
Awarded Nov 22 '18 at 13:10
General Induction Principle
Awarded Nov 22 '18 at 0:50
(post deleted or otherwise unavailable)
Awarded Nov 17 '18 at 18:25
(post deleted or otherwise unavailable)
Awarded Nov 17 '18 at 0:35
Empirical Rademacher averages versus Hoeffdings bound
Awarded Nov 16 '18 at 17:35
Understanding the Proof of Strong Normalization of the Calculus of Constructions
Awarded Nov 4 '18 at 23:10
Time complexity of exponentiating s-sparse matrices
Awarded Nov 4 '18 at 15:30
Typing of substitution in a bidirectional type system
Awarded Nov 2 '18 at 11:45
Minimization version of matrix p-norms?
Awarded Oct 28 '18 at 16:05
How to talk about theory
Awarded Oct 23 '18 at 19:45
Algorithm whose running time depends on P vs. NP
Awarded Oct 20 '18 at 23:35
(post deleted or otherwise unavailable)
Awarded Oct 20 '18 at 20:00
(post deleted or otherwise unavailable)
Awarded Oct 18 '18 at 3:05
(post deleted or otherwise unavailable)
Awarded Oct 17 '18 at 15:55
Linear optimization over intersection of totally unimodular matrices
Awarded Oct 16 '18 at 19:15
Is there a non-deterministic version of the complexity class PP?
Awarded Oct 15 '18 at 11:15
(post deleted or otherwise unavailable)
Awarded Oct 12 '18 at 10:55
What is the most intuitive dependent type theory I could learn?
Awarded Oct 12 '18 at 7:45
(post deleted or otherwise unavailable)
Awarded Oct 7 '18 at 15:50
1 2 3 4 5 … 56