Theoretical Computer Science
dspyz
  • Member for 8 years, 11 months
  • Last seen this week
Profile Activity

15 Questions

Votes Activity Newest Views
2 answers
10 votes
1k views
1 bookmarks
Is Almost-2-SAT NP-hard?
1 answers
6 votes
225 views
Does the 0-1 principle apply to merge networks?
1 answers
6 votes
385 views
1 bookmarks
Would an optimal sorting network ever have to swap two numbers the "wrong" way
1 answers
5 votes
77 views
Can a normal form term be extensionally equivalent to a term with no WHNF?
1 answers
5 votes
447 views
Worst case ratio between minimum clique cover and maximum independent set
1 answers
4 votes
324 views
Asymptotic complexity of CDCL SAT solver that only selects negative literals
1 answers
3 votes
72 views
1 bookmarks
Translating pure literal elimination into rup
0 answers
2 votes
190 views
Most general form of SAT which is in P
1 answers
2 votes
927 views
How to approximate minimum clique edge cover
0 answers
1 votes
45 views
Find all paths between specially paired nodes in a DAG in linear time
0 answers
1 votes
72 views
Best Asymptotic Complexity for Persistent Union Find
0 answers
0 votes
32 views
Is having a particular form equivalent to being computable for functions on Church numerals?
3 answers
0 votes
274 views
Terminology for complete k-partite graph where k is not fixed
0 answers
0 votes
197 views
Finding assignment-minimum complete k-partite graph cover
1 answers
-2 votes
67 views
Assign each biclique to a distinct left

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.