Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User amrinderarora
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(38)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(37)
Randomized Algorithms
(1)
Questions by amrinderarora
0
votes
2
answers
How can we solve the 8 puzzle problem using Branch & Bound approach?
asked
Apr 9, 2019
in
Branch & Bound
n-puzzle
a-star
0
votes
1
answer
Is Harmonic Mean of admissible heuristics an admissible heuristic?
asked
Apr 8, 2019
in
Informed Search
admissible
heuristic
a-star
0
votes
8
answers
Gold is a precious metal
asked
Mar 29, 2019
in
Dynamic Programming
maximize-value
gold
0
votes
1
answer
Converting ternary constraint into binary constraints
asked
Feb 9, 2019
in
Informed Search
constraint-satisfaction-problem
csp
0
votes
1
answer
Manhattan Distances, but Linear Interference...
asked
Feb 2, 2019
in
Informed Search
8-puzzle
heuristic
a-star
0
votes
2
answers
Give an example of a task environment that is..
asked
Jan 25, 2019
in
Informed Search
task-environments
0
votes
1
answer
Find the smallest domain value where the function becomes negative.
asked
Sep 26, 2018
in
Divide & Conquer
0
votes
2
answers
Randomized Algorithm - Basics (4 Questions in 1)
asked
Sep 12, 2018
in
Randomized Algorithms
randomized
asymptotic-analysis
0
votes
1
answer
Solve the Recurrence Relation: T(n) = T(n/4) + T(3n/4) + n^2
asked
May 7, 2018
in
Asymptotic Analysis
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
0
votes
3
answers
Admissible Heuristic for n-Queens Problem
asked
Mar 24, 2018
in
Informed Search
n-queens
conflict
ai
0
votes
1
answer
In the context of informed search, what is the difference between complete, optimal and optimally efficient algorithm?
asked
Mar 18, 2018
in
Informed Search
a-star
0
votes
1
answer
N-Queens Count all conflicts in O(n) time
asked
Mar 2, 2018
in
Informed Search
n-queens
ai
count
conflict
0
votes
2
answers
Prove that 3-Coloring is NP Hard (starting with SAT as known NP hard problem)
asked
Nov 29, 2017
in
NP-Completeness
np-completeness
vertex-coloring
satisfiability
0
votes
2
answers
Chromatic Number, Relation to Max Degree
asked
Nov 22, 2017
in
Greedy Algorithms
graph-coloring
graph
greedy
0
votes
2
answers
How to generate a random connected graph?
asked
Oct 15, 2017
in
Graph Theory
graph
random-graph-generation
+1
vote
5
answers
Graph with no 3-clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
graph
vertex-coloring
0
votes
1
answer
Maximum Value Contiguous Subregion
asked
Jul 23, 2017
in
Dynamic Programming
mvcs
dynamic-programming
+1
vote
3
answers
Three Set Sum: Given an integer k and 3 sets A, B and C, find a, b, c such that a + b + c = k
asked
Jul 23, 2017
in
Divide & Conquer
sorted-lists
searching
+1
vote
2
answers
Calculate g(1000) given the following definition of g function..
asked
Jun 8, 2017
in
Dynamic Programming
recurrence-relations
+10
votes
3
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
asked
Feb 14, 2017
in
Divide & Conquer
asymptotic-analysis
recurrence-relations
time-complexity
substitution-method
Page:
« prev
1
2
3
4
5
6
next »
...