Skip to main content
Computer Science

Editor

 Editor
First edit.
Awarded 16822 times.
Has a Torus data structure been constructed?
Awarded yesterday
What algorithm can be used to implement code folding for the C programming language?
Awarded yesterday
Arguments for 128-bit processors now (or even a 96-bit)
Awarded May 6 at 2:38
Arguments for 128-bit processors now (or even a 96-bit)
Awarded May 4 at 17:01
is every non-trivial language in RE reducible to every language not in (RE union co-RE)?
Awarded May 4 at 15:11
Show that in every pure SPNE, the first agent weakly prefers their own bundle to any other
Awarded May 4 at 1:34
Help understanding how to reduce to a symmetry-based coloring problem (NP-completeness)
Awarded May 3 at 17:56
Finding loop invariant
Awarded Apr 30 at 7:07
Existence of min(m,n) matching on a m, n (not necessarily complete) Bipartite graph
Awarded Apr 29 at 22:02
Express boolean logic operations in zero-one integer linear programming (ILP)
Awarded Apr 29 at 19:49
How to quickly compute power of matrix of generating functions?
Awarded Apr 29 at 2:11
How to deal with the relationship between [algorithms with time complexity $O(n^c)$] and [polynomial-time algorithms]?
Awarded Apr 28 at 8:15
How to deal with the relationship between [algorithms with time complexity $O(n^c)$] and [polynomial-time algorithms]?
Awarded Apr 28 at 8:15
Trilinear sum of characters in $\mathbb{Z}_2^n$
Awarded Apr 28 at 5:45
Is class $\mathrm{CFL} \cup \mathrm{coCFL}$ closed under homomorphism or inverse homomorphism?
Awarded Apr 26 at 9:07
Open Problem: Structural Learnability of Pseudo-Random Boolean Circuits
Awarded Apr 24 at 11:03
Longest path between vertice v,w based on v,u
Awarded Apr 23 at 23:12
I need to show that the problem is NP-complete
Awarded Apr 23 at 17:27
Is class CFL U coCFL closed under intersection, union?
Awarded Apr 23 at 17:21
Proof of an Optimal substructure in Dynamic Programming?
Awarded Apr 22 at 19:51
Epsilon or Lambda Transition Consumption Rules
Awarded Apr 22 at 19:51
Complexity of a Turing Machine when changing its alphabet to binary
Awarded Apr 22 at 19:51
Comparison of Two Algorithms for Finding a Position of 1 in an Array with Equal Zeros and Ones
Awarded Apr 22 at 19:51
(post deleted or otherwise unavailable)
Awarded Apr 22 at 4:38
What could a neat circuit using full adders implementing selectable arithmetic operations on two 3-bit inputs look like?
Awarded Apr 19 at 16:40
Is a Minimum Weight SPT the MST of a Bigraph?
Awarded Apr 19 at 13:05
Does large constants make solving this partition problem easier?
Awarded Apr 19 at 8:53
(post deleted or otherwise unavailable)
Awarded Apr 18 at 6:51
Number of cycles in a digraph (Resource Allocation Graph)
Awarded Apr 17 at 20:08
prove\disprove : $L_1 \cup L_2 \notin RE$ and $L_1 \cap L_2 \notin RE$ $\implies$ $L_1 \notin R$
Awarded Apr 17 at 8:48
Existence of isomorphism between two algebraic data types that have the same "generating function"
Awarded Apr 17 at 5:16
Generating a parity-check compatible number set
Awarded Apr 15 at 19:09
Use automated theorem prover / SMT solver to study axioms on point-set topologies [migrated]
Awarded Apr 15 at 10:49
Does having fixed "partitions" make Consistent Hashing impossible?
Awarded Apr 12 at 15:48
Applications of model counting
Awarded Apr 11 at 23:02
(post deleted or otherwise unavailable)
Awarded Apr 11 at 5:50
(post deleted or otherwise unavailable)
Awarded Apr 7 at 18:04
(post deleted or otherwise unavailable)
Awarded Apr 7 at 16:39
Undecidability of closure under reverse of language accepted by TM
Awarded Apr 7 at 7:23
Designing an algorithm logic for RF identification
Awarded Apr 7 at 6:48
(post deleted or otherwise unavailable)
Awarded Apr 6 at 8:58
Binary jumping line function intersection minimum search
Awarded Apr 5 at 13:30
Show that both the standard and bottom-up greedy strategies give the same outcomes
Awarded Apr 5 at 11:12
Find path in Directed Acyclic Graph from starting to ending node where each node is connected from an ancestor in the path
Awarded Apr 5 at 3:21
(post deleted or otherwise unavailable)
Awarded Apr 1 at 11:11
How to determine the asymptotics of non-linear recurrence relations?
Awarded Mar 31 at 19:45
The problem of reachability in a directed graph, but all predecessors must be reached to reach a node
Awarded Mar 29 at 10:49
(post deleted or otherwise unavailable)
Awarded Mar 27 at 13:45
Why we can not define factorial in lambda calculus
Awarded Mar 27 at 7:57
What does BB^T represent for digraphs?
Awarded Mar 25 at 18:52
How to construct a DFSM and Context-Free Grammar (CFG) for this language?
Awarded Mar 25 at 10:25
Is the language a^nb^nc^m | m > n context free?
Awarded Mar 24 at 14:53
(post deleted or otherwise unavailable)
Awarded Mar 24 at 9:55
(post deleted or otherwise unavailable)
Awarded Mar 23 at 14:01
(post deleted or otherwise unavailable)
Awarded Mar 23 at 11:21
(post deleted or otherwise unavailable)
Awarded Mar 22 at 17:15
Avoid brute forcing all combinations for this optimisation problem
Awarded Mar 21 at 12:43
Graham's Greedy Algorithm is optimal for (2m) machines
Awarded Mar 21 at 9:16
Avoid brute forcing all combinations for this optimisation problem
Awarded Mar 20 at 16:47
(post deleted or otherwise unavailable)
Awarded Mar 20 at 14:26
1
2 3 4 5
…
281