Skip to main content

Top Questions

0 votes
8 answers
1k views

Why do computers use binary numbers in IEEE754 fraction instead of BCD or DPD?

6 votes
2 answers
1k views

How to determine if a set is countable or uncountable?

4 votes
3 answers
571 views

Functor composition rule necessary?

3 votes
2 answers
467 views

The number of triple intersections of lines

2 votes
2 answers
461 views

Do all instances of a given string get replaced under a rewrite rule?

3 votes
1 answer
894 views

How to allocate memory in NASM without C functions (x64)?

1 vote
2 answers
234 views

How do logic gates handle if-else statements?

2 votes
1 answer
466 views

What role does the lower bound play in the statement of Savitch's Theorem?

2 votes
3 answers
146 views

How to simplify $O(\log (n!))$?

3 votes
1 answer
328 views

Minimum number of oracle call to solve Simon problem by a (NDTM) non-deterministic Turing machine?

2 votes
2 answers
105 views

Can a universal worst case problem instance exist?

-1 votes
2 answers
126 views

Will this proof method work for p vs np

2 votes
2 answers
235 views

Solving the "Reverse" Assignment Problem with an Added Constraint?

1 vote
1 answer
203 views

Which class is the language MAX-CLIQUE in?

1 vote
1 answer
237 views

Is UNIQUE(N) Turing-recognizable?

2 votes
1 answer
171 views

NP-Hardness: Finding the Best Subtree for Hierarchical Matching in Elasticsearch

2 votes
2 answers
200 views

Solving the "reverse" Assignment Problem?

1 vote
1 answer
64 views

How to make a NAND gate with vaccum tubes?

1 vote
1 answer
160 views

Can this Integer Linear Programming problem be solved in polynomial time?

1 vote
1 answer
84 views

$L'=\left \{ z^Rx : xyz\in L \right \}$ is regular

1 vote
1 answer
101 views

result of a union between a decidable language and not recognizable one - disjoint

1 vote
1 answer
58 views

Give a class of languages which is closed under intersection and union, but not under complement

1 vote
1 answer
90 views

Why does problem F belong to PSPACE?

1 vote
1 answer
147 views

What is the connection between a regular language's pumping number, and the number of states of an equivalent deterministic automaton?

1 vote
2 answers
54 views

Can one theoretically prove one version of algorithm is more efficient without running the code?

3 votes
1 answer
111 views

Minimize sum of array after repeated replacement of numbers with their OR operation result

2 votes
1 answer
101 views

$LL=\left \{ xyzy^R : xyz\in L \right \}$ is context free language

1 vote
1 answer
96 views

set of words w such that M halts on w is decidable

1 vote
1 answer
58 views

When is an algorithm "equal" to another?

4 votes
1 answer
56 views

Detecting/removing thin sections of polygons

4 votes
1 answer
55 views

Question about tidy trees (Union-Find)

6 votes
0 answers
109 views

Is it possible to efficiently maintain a directed graph where nodes unreachable from the root are deleted?

-1 votes
2 answers
58 views

Myhill-Nerode sentence and the relation $R_L$

1 vote
1 answer
73 views

How do you show Dominating Set is NP Complete

3 votes
1 answer
44 views

Where was DJBX33A first published?

3 votes
0 answers
116 views

Convert a regular expression to a *minimal* LL(1) regular grammar

1 vote
1 answer
54 views

How to reduce a term to normal form

1 vote
2 answers
53 views

Is this LTL formula really valid?

2 votes
1 answer
45 views

A question about the number of states of a Turing machine using the alphabet $\{ 0, 1, \square, \rhd \}$

0 votes
1 answer
44 views

Can we use XOR's forced branching to show that NP!=P

0 votes
2 answers
54 views

prove AP-SUM is NP-complete

1 vote
2 answers
49 views

Finding two disjont longest possible vertical or horizontal lines in 2D matrix with non-usable cells

0 votes
1 answer
48 views

Is the difference between an unrecognizable language and a finite language decidable? recognizable?

1 vote
2 answers
37 views

Complexity of checking validity of downscaled game of life

0 votes
1 answer
47 views

The number of words that M doesn't accept is finite

4 votes
1 answer
58 views

Proving that two languages both represent valid bracket sequences

0 votes
1 answer
43 views

How to show $NP^{BQP} = QMA$?

0 votes
1 answer
39 views

Balancing players into two teams


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