Hottest Questions Today

1

vote

2

answers

90

views

Can the pre-order traversal of two different trees be the same even though they are different?

modified 1 hour ago lox 1,007

1

vote

1

answer

11

views

Log-Space Reduction $USTCON\le_L CO-2Col$

complexity-theory graph-theory reductions

answered 1 hour ago Yuval Filmus 202k

0

votes

1

answer

15

views

Help: Context Free Grammar

context-free

modified 5 hours ago ElDon90 17

0

votes

0

answers

13

views

Uncomputably coded model of computation

turing-machines computability lambda-calculus computation-models turing-completeness

asked 8 hours ago Punga 1

1

vote

1

answer

21

views

Superset of another language and recognizability of turing machines

turing-machines

answered 8 hours ago Yuval Filmus 202k

2

votes

1

answer

28

views

Selecting items from two arrays without duplicate indices to get maximum sum

dynamic-programming greedy-algorithms

modified 9 hours ago Pushkar Soni 13

2

votes

1

answer

19

views

Number of equivalence classes in $P$

complexity-theory time-complexity polynomial-time

modified 2 hours ago MLnoob 13

2

votes

1

answer

27

views

How to find size of each tree in a forest?

trees

modified 10 hours ago lox 1,007

0

votes

1

answer

16

views

What is a uniform algorithm?

algorithms algorithm-analysis

answered 11 hours ago Daniel Mera 1

1

vote

2

answers

21

views

Universal hashing function probability

hash

16 hours ago

3

votes

2

answers

21

views

How do you prove a heuristic is admissible?

artificial-intelligence heuristics

modified 5 hours ago Carlos Linares López 2,884

29

votes

6

answers

6k

views

Why are ambiguous grammars bad?

compilers ambiguity

modified yesterday ComFreek 251

2

votes

1

answer

109

views

Showing that a language is NP Complete (advice)

complexity-theory

answered yesterday David Richerby 72.6k

0

votes

0

answers

15

views

Adding edges to a DAG to make it strongly connected with minimum cost

graph-theory

asked 18 hours ago phqb 1

1

vote

0

answers

24

views

Is $ L = \{ a^n\ |\ a^n \not\in L_n \} $ Turing recognizable (recursively enumerable)?

turing-machines undecidability semi-decidability

asked yesterday Da Mike 47

2

votes

1

answer

16

views

Help with figuring out if MAX(L) is a CF language

automata context-free

answered yesterday Yuval Filmus 202k

0

votes

0

answers

13

views

Is the expression (λx.xx)(λy.y) typeable in the following system?

type-theory type-inference

asked yesterday micsza 37

0

votes

0

answers

12

views

What is a polynomial-time algorithm for determining whether two trees, with colored nodes, are isomorphic or not

graphs graph-theory trees colorings graph-isomorphism

asked yesterday Toothpick Anemone 188

1

vote

1

answer

55

views

Are all compilers Turing Machines?

turing-machines compilers

answered yesterday David Richerby 72.6k

1

vote

1

answer

14

views

Complexity and hardness of undirected path

complexity-theory space-complexity

answered yesterday Yuval Filmus 202k

4

votes

1

answer

92

views

Matching Algorithm - How to maximize matched quantity with unique matching rules?

algorithms graphs time-complexity matching bipartite-matching

modified 18 hours ago luca590 121

1

vote

0

answers

70

views

+100

How does a Turing machine with one tape read its input?

turing-machines computability

modified 8 hours ago Yuval Filmus 202k

1

vote

1

answer

59

views

Is “Query Equivalence” decidable?

computability database-theory

answered yesterday Curtis F 507

2

votes

0

answers

45

views

Minimum clique cover

graph-theory reductions linear-programming integer-programming clique

modified 7 hours ago Rodrigo de Azevedo 700

0

votes

1

answer

37

views

Given n standard C++ STL maps, can I merge them? [on hold]

algorithms data-structures

modified yesterday rici 4,755

-1

votes

0

answers

15

views

How to precisely know whether a language is regular ? , a regular expression can be generated for it ? , as well as dfa? [on hold]

automata finite-automata

asked yesterday Abhyuday Srivastava 1

1

vote

1

answer

33

views

Can the difference of a non-regular and a regular language be regular?

automata regular-languages

modified yesterday Yuval Filmus 202k

0

votes

1

answer

28

views

String matching and bioinformatics [on hold]

reference-request bioinformatics string-matching

modified yesterday Evil 8,487

-1

votes

1

answer

71

views

Can we find every 216 digit number combination? [on hold]

computability mathematical-programming mathematical-analysis mathematical-software

modified 22 hours ago Jonathan Irons 99

1

vote

1

answer

23

views

calculating a shortest path in a table structure that changes in real time

shortest-path

answered yesterday BlueRaja - Danny Pflughoeft 885

28

votes

2

answers

4k

views

Is Lambda Calculus purely syntactic?

lambda-calculus functional-programming

modified Jun 10 at 6:27 Camion 101

1

vote

2

answers

26

views

What is the graphic TSP?

graphs weighted-graphs traveling-salesman

answered 2 days ago David Richerby 72.6k

1

vote

0

answers

27

views

Given complete graph, find optimal path with two costs on each edge

graphs shortest-path

modified yesterday BlueRaja - Danny Pflughoeft 885

2

votes

1

answer

26

views

One-taped RAM vs Multi-taped RAM

complexity-theory turing-machines

answered 2 days ago Yuval Filmus 202k

0

votes

0

answers

23

views

Why can't we generate the output of a cellular automata at time step t without first generating all the preceding states

complexity-theory cellular-automata

asked yesterday patrick_corrigan 101

1

vote

2

answers

62

views

Algorithm for generating random incrementing numbers up to a limit

algorithms

modified yesterday Apass.Jack 17k

2

votes

1

answer

48

views

Thought process for the following problem?

algorithms arrays

modified 2 days ago Navjot Waraich 728

3

votes

0

answers

32

views

Iterating over a union of sets denoted by bitmasks

boolean-algebra enumeration

asked 2 days ago Mikhail Maltsev 116

0

votes

0

answers

19

views

$NTime(2^n) \subseteq NSpace(n^k)$ implies $EXP = PSPACE$?

complexity-theory

asked 2 days ago LioH 128

1

vote

0

answers

14

views

How to adapt proof of the ND time hierarchy theorem for alternate definition of NDTM?

complexity-theory turing-machines time-complexity nondeterminism

asked yesterday kotu 48

1

vote

1

answer

19

views

Complexity of “half cycle”

complexity-theory np-complete

modified 2 days ago Yuval Filmus 202k

2

votes

1

answer

35

views

How to calculate Big O of $T(n) = aT(n^b) + f(n)$?

complexity-theory time-complexity big-o-notation

answered 2 days ago Apass.Jack 17k

0

votes

1

answer

61

views

Is computer science really a branch or sub-branch of physics? [on hold]

physics

modified Jun 13 at 11:29 orlp 6,610

3

votes

2

answers

47

views

Proving a problem as NP-complete

np-complete np

answered 2 days ago David Richerby 72.6k

1

vote

0

answers

24

views

Substituting a term for a variable in a context

logic type-theory notation

asked 2 days ago CuriousKid7 149

0

votes

0

answers

24

views

Space(n) and Space(n^2) implications

complexity-theory space-complexity

modified 2 days ago Stefano Ferraro 8

2

votes

1

answer

296

views

+150

Solving recurrence relation with minimum and factorial

recurrence-relation factorial

modified 13 hours ago Evil 8,487

5

votes

1

answer

65

views

Searching a Treasure

algorithms complexity-theory time-complexity search-algorithms

modified 2 days ago Apass.Jack 17k

Top Questions

Looking for more? Browse the complete list of questions, or popular tags. Help us answer unanswered questions.