Theoretical Computer Science

Help Center > Badges > Editor

 Editor
First edit.
Awarded 3603 times.
Weighted matching algorithm for minimizing max weight
Awarded 8 hours ago
Optimal point placement on integer lattice
Awarded yesterday
I need solution for assignment which I've to submit today [closed]
Awarded yesterday
(post deleted or otherwise unavailable)
Awarded Mar 27 at 21:10
Subgraph isomorphism on graph sequences
Awarded Mar 27 at 4:45
Notation of sequences in rate distortion theory
Awarded Mar 26 at 16:25
(post deleted or otherwise unavailable)
Awarded Mar 24 at 19:25
What is the evidence that the worst-case runtime of CDCL is exponential in the length of CNF?
Awarded Mar 23 at 3:35
Technical lemma about curves used in original proof of PCP theorem
Awarded Mar 20 at 18:20
(post deleted or otherwise unavailable)
Awarded Mar 20 at 14:45
(post deleted or otherwise unavailable)
Awarded Mar 16 at 14:20
Variation of edge-disjoint spanning trees
Awarded Mar 12 at 22:55
Timing a career switch from math to TCS [migrated]
Awarded Mar 6 at 1:00
Results on universal approximation for learners other than ANNs
Awarded Mar 5 at 13:40
existence & characterization of “kolmogorov efficient” programs
Awarded Feb 28 at 14:40
(post deleted or otherwise unavailable)
Awarded Feb 27 at 8:20
(post deleted or otherwise unavailable)
Awarded Feb 26 at 23:35
(post deleted or otherwise unavailable)
Awarded Feb 26 at 5:50
(post deleted or otherwise unavailable)
Awarded Feb 26 at 5:50
Complexity of solving systems of linear equations with hash preimages
Awarded Feb 25 at 20:25
What would be the next step after quantum computing? [closed]
Awarded Feb 21 at 7:15
weights in low density codes
Awarded Feb 19 at 12:45
Complexity of constructing minimum depth decision trees
Awarded Feb 14 at 11:55
What papers should everyone read?
Awarded Feb 14 at 9:15
What is the fastest algorithm to compute rank of a rectangular matrix?
Awarded Feb 6 at 1:15
Problem in deterministic time $n^p$ and not lower
Awarded Feb 5 at 2:15
Dialogue writing style & Yuri Gurevich's imaginary student: Quisani
Awarded Feb 1 at 21:45
The complexity of the permanent of low rank matrices
Awarded Jan 31 at 15:20
Average case hardness of #SAT
Awarded Jan 31 at 14:25
W[1]-hard problems with FPT time approximation algorithms
Awarded Jan 29 at 17:10
Online bipartite matching vs Multi-armed bandits
Awarded Jan 28 at 0:55
(post deleted or otherwise unavailable)
Awarded Jan 26 at 13:45
Minimum Unsatisfiable 3-CNF Formulae
Awarded Jan 24 at 1:20
(post deleted or otherwise unavailable)
Awarded Jan 23 at 8:20
(post deleted or otherwise unavailable)
Awarded Jan 21 at 20:25
(post deleted or otherwise unavailable)
Awarded Jan 18 at 7:45
Known property? Maximum radius of connected induced subgraph
Awarded Jan 17 at 18:55
Fast Computation of First k Eigenvectors of Graph Laplacian
Awarded Jan 15 at 10:50
Can recursion be replaced with a finite set of higher-order functions? [closed]
Awarded Jan 15 at 8:40
(post deleted or otherwise unavailable)
Awarded Jan 11 at 22:45
(post deleted or otherwise unavailable)
Awarded Jan 10 at 10:10
(post deleted or otherwise unavailable)
Awarded Jan 9 at 4:40
(post deleted or otherwise unavailable)
Awarded Jan 7 at 21:50
Convex polygons inclusion relation
Awarded Jan 7 at 16:40
(post deleted or otherwise unavailable)
Awarded Jan 5 at 13:40
Is there a result in computability theory that does not relativize?
Awarded Jan 5 at 0:10
Applications of Barendregt–Geuvers–Klop conjecture
Awarded Jan 3 at 2:15
In quantum money schemes, how is the list of serial numbers provided?
Awarded Jan 2 at 7:10
(post deleted or otherwise unavailable)
Awarded Dec 27 '19 at 14:45
(post deleted or otherwise unavailable)
Awarded Dec 26 '19 at 12:45
(post deleted or otherwise unavailable)
Awarded Dec 24 '19 at 16:50
(post deleted or otherwise unavailable)
Awarded Dec 24 '19 at 8:55
What are the widely used notations for quickly referring to a single component of a multi-component object?
Awarded Dec 23 '19 at 0:00
Representing data with Shannon entropy predicted bits
Awarded Dec 21 '19 at 14:30
Bivariate low-degree polynomial testing of Polishchuk-Spielman
Awarded Dec 20 '19 at 18:45
Hardness of finding if a vertex lies on a simple directed path between two vertices
Awarded Dec 19 '19 at 5:15
(post deleted or otherwise unavailable)
Awarded Dec 18 '19 at 23:35
(post deleted or otherwise unavailable)
Awarded Dec 18 '19 at 15:20
Rackoff's coverability bounds in case the addition vectors of VAS are over {-1, 0, 1} and the target vector is over {0, 1}?
Awarded Dec 17 '19 at 10:00
Type System Of $\lambda\mu$-Calculus
Awarded Dec 16 '19 at 11:10
1
2 3 4 5
…
61