Computer Science
csTheoryBeginner
  • Member for 3 years, 11 months
Profile Activity
Stats
321
reputation
18k
reached
10
answers
10
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
1
silver badge
10
bronze badges
Top tags
View all tags
9
Score
6
Posts
30
Posts %
8
Score
6
Posts
30
Posts %
2
Score
2
Posts
10
Posts %
2
Score
2
Posts
10
Posts %
0
Score
4
Posts
20
Posts %
0
Score
4
Posts
20
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
3
If a CNF contains only Horn and Xor clauses, then what is the complexity of determining Satisfiability?
Nov 19 '17
3
Deleting nodes from graph so that they can be separated by a straight line
Dec 3 '17
2
Can Floyd-Warshall algorithm be used in an undirected graph with negative edges?
Mar 20 '18
2
Simplex Algorithm: Why must the optimal value of the LP lie on the face or vertex of a polyhedron?
Nov 22 '17
2
How to find spanning tree of a graph that minimizes the maximum edge weight?
Nov 22 '17
2
What does binary NP-Hard exactly mean?
Nov 30 '18
2
What is the complexity of determining Satisfiability of a CNF containing both Horn and Dual Horn clauses?
Nov 14 '17
1
Upper bound on the average number of overlaps for an interval within a set of intervals
Jan 6 '20
1
Help needed for understanding proof of No Regret Multi Armed Bandit Algorithm
Nov 14 '18
1
On the limitation of the "adversary" in randomization for online learning
Nov 2 '18
Top network posts
View all network posts
13
On using correct notation in research papers
12
Recovering primal optimal solutions from dual sub gradient ascent using ergodic primal sequences
7
Quadratic programming using CPLEX: how to check whether candidate is an extreme point?
6
Complexity \ Reference request for variant of max flow problem
6
Obtaining the system of irredundant inequalities from a set of inequalities using CPLEX

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.