Skip to main content
Computer Science
NaturalLogZ's user avatar
NaturalLogZ's user avatar
NaturalLogZ's user avatar
NaturalLogZ
  • Member for 5 years, 5 months
  • Last seen this week
Profile Activity
Stats
771
reputation
17k
reached
27
answers
0
questions
Communities
View all
About

Interested in graph theory and approximation algorithms. Currently working in routing algorithms for an engineering firm.

MSci, Operations Research and Information Engineering, Cornell University
MMath, Combinatorics & Optimization, University of Waterloo
BMath, Honours Combinatorics & Optimization, Joint Honours Computer Science, University of Waterloo

Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
9
bronze badges
Top tags
View all tags
16
Score
2
Posts
7
Posts %
14
Score
7
Posts
26
Posts %
10
Score
7
Posts
26
Posts %
10
Score
4
Posts
15
Posts %
8
Score
3
Posts
11
Posts %
5
Score
4
Posts
15
Posts %
Top posts
View all questions and answers
answer
15
P = NP clarification
Feb 11, 2020
answer
7
Time Complexity of Linear Search vs Brute Force
Sep 12, 2023
answer
6
What is a fractional matching?
Apr 18, 2019
answer
4
Should a PDA reject words not in language?
Jun 25
answer
4
When is an algorithm "equal" to another?
Aug 29
answer
3
Is there a formal definition of sub-instances or sub-problems?
Oct 20, 2020
answer
3
Can the MST's "cut property" be derived from the "cycle property" and vice versa?
Feb 29
answer
3
Why do we use summations when computing time complexity?
May 15
answer
2
$L_1\in P$ , $L_2\in NP$, is it possible that $L_1\cup L_2 \in P$
Mar 24
answer
1
Algorithm to get any spanning tree not necessarily a minimum spanning tree
Apr 8, 2021
Top network posts
View all network posts
20
Research in mathematics without a degree in mathematics
8
How should you respond when a professor answers your question with "It's obvious!"?
5
What are examples of recent relatively simple 'toolbox algorithms'?