Computer Science Stack Exchange

0

votes

1

answer

36

views

Is it possible to train a neural network to solve NP-complete problems?

np-complete machine-learning

answered 2 hours ago Richie Yeung 46

0

votes

0

answers

5

views

Why can we not obtain a unique solution for orientation from Essential Matrix?

computer-vision

asked 2 hours ago PyWalker2797 101

-1

votes

0

answers

7

views

Standard and Compressed Tries (Insertion, Deletion, Induction)

trees induction information-retrieval

asked 3 hours ago Sandy 1

0

votes

1

answer

39

views

Is there a way to map the concatenation operation over strings to the addition operation over $\mathbb{N}$

complexity-theory formal-languages formal-grammars

modified 3 hours ago Dmitry 346

0

votes

1

answer

35

views

Removing left factoring from Context-Free Grammar

automata context-free formal-grammars parsers

answered 4 hours ago André Souza Lemos 3,104

2

votes

0

answers

21

views

Is minimising the total number of one entries in binary matrices $CA$ and $C^TB$ NP-HARD?

algorithms complexity-theory matrix

modified 4 hours ago D.W.♦ 122k

0

votes

1

answer

79

views

Travelling Salesman Problem Easy Algorithms

algorithms traveling-salesman

modified 5 hours ago Community♦ 1

0

votes

0

answers

12

views

Calculating the structural integrity of a pixel grid

graphs graph-traversal

modified 6 hours ago Jugbot 1

0

votes

1

answer

40

views

Is protein folding NP-hard and how to prove that?

complexity-theory reductions np-hard

modified 6 hours ago 0x90 209

0

votes

0

answers

13

views

Difficulty in few steps in proof of “Amortized cost of $\text{Find-Set}$ operation is $\Theta(\alpha(n))$”assuming union by rank, path compression

algorithm-analysis data-structures amortized-analysis union-find disjoint-sets

modified 7 hours ago Abhishek Ghosh 596

-3

votes

1

answer

75

views

I have a decision problem with $2^n$ bit sized certificates, how would I verify my decision problem efficiently if it is in $NP$?

decision-problem

modified 7 hours ago Travis Wells 263

12

votes

0

answers

175

views

the two-color leapfrog problem in P?

complexity-theory turing-machines

modified 7 hours ago user326210 418

0

votes

2

answers

32

views

Find the smallest group of numbers with sum bigger then $X$

subset-sum summation

modified 8 hours ago Niki 136

0

votes

0

answers

20

views

Design of a synchronized clock

data-compression clocks

asked 9 hours ago Ahmedou 1

Jun	JUL	Aug
	20
2019	2020	2021

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Is it possible to train a neural network to solve NP-complete problems?

Why can we not obtain a unique solution for orientation from Essential Matrix?

Standard and Compressed Tries (Insertion, Deletion, Induction)

Is there a way to map the concatenation operation over strings to the addition operation over $\mathbb{N}$

Removing left factoring from Context-Free Grammar

Is minimising the total number of one entries in binary matrices $CA$ and $C^TB$ NP-HARD?

Travelling Salesman Problem Easy Algorithms

Calculating the structural integrity of a pixel grid

Is protein folding NP-hard and how to prove that?

Difficulty in few steps in proof of “Amortized cost of $\text{Find-Set}$ operation is $\Theta(\alpha(n))$”assuming union by rank, path compression

I have a decision problem with $2^n$ bit sized certificates, how would I verify my decision problem efficiently if it is in $NP$?

the two-color leapfrog problem in P?

Find the smallest group of numbers with sum bigger then $X$

Design of a synchronized clock

Hot Network Questions