Hottest Questions This Month

4

votes

2

answers

1k

views

Is the language regular or not?

modified Jul 23 at 21:49 Rostami.M 1,374

5

votes

5

answers

842

views

Prove a lower bound

modified Jul 22 at 23:05 Steven 17.6k

10

votes

1

answer

1k

views

Why is the probability of a false positive not 0 for Freivald's Algorithm?

algorithms linear-algebra randomized

modified Jul 13 at 22:55 D.W.♦ 133k

2

votes

2

answers

647

views

Betweenness Problem for Binary Comparisons is NP-Complete

time-complexity

modified Jul 12 at 13:07 Yuval Filmus 256k

3

votes

1

answer

522

views

Faster algorithm for a specific inversion

algorithms time-complexity combinatorics permutations

modified Jul 10 at 18:01 Nikos M. 913

4

votes

2

answers

191

views

Why are Regular sets not closed under infinite unions and intersections? [duplicate]

regular-languages finite-automata type-theory

answered yesterday reinierpost 4,123

3

votes

4

answers

263

views

Why is TCP known as reliable process?

computer-networks

modified Jul 23 at 5:24 pveentjer 231

3

votes

1

answer

673

views

What is this algorithm computing and how to prove it?

factoring

modified yesterday jwodder 117

2

votes

2

answers

388

views

Why does page size affect page table size?

operating-systems memory-management virtual-memory paging

modified Jul 11 at 18:39 justhalf 103

4

votes

3

answers

306

views

Clarification on the algorithm for finding a majority element

algorithms divide-and-conquer

answered Jul 18 at 8:46 user21820 372

6

votes

1

answer

238

views

Hashing using Horner’s Rule

hash

modified Jul 8 at 18:23 Inuyasha Yagami 1,844

2

votes

2

answers

94

views

Test if $ \sum_{n=0}^\infty \frac{n^2}{2^n} $ = O(1)

asymptotics

modified Jul 7 at 5:18 Rostami.M 1,374

0

votes

2

answers

252

views

Can databases use data structures/algorithms to respond to arbitrary queries?

algorithms database-theory

modified Jul 12 at 16:37 Hedayatullah Sarwary 257

4

votes

2

answers

195

views

Why did finite-state controller with datapath win?

computer-architecture reference-request computation-models

modified Jul 16 at 8:12 Shashank V M 427

2

votes

1

answer

328

views

Finding the maximum sum series in time complexity of O(n)

algorithms time-series-analysis

modified Jul 4 at 9:08 Steven 17.6k

5

votes

2

answers

108

views

Is $\log^{}(\log(n)) = \Theta (\log(\log^{}(n)))$?

asymptotics

modified Jul 4 at 4:08 Blanco 567

4

votes

2

answers

106

views

tautology vs satisfiability

complexity-theory turing-machines computability reductions np

answered Jul 26 at 12:11 Highheath 525

3

votes

2

answers

200

views

Relationship between complexity classes W[1] and NP?

np parameterized-complexity

answered Jul 21 at 10:19 Discrete lizard♦ 6,530

6

votes

2

answers

122

views

How can we count the number of pairs of coprime integers in an array of integers? (CSES)

algorithms number-theory counting mathematical-analysis primes

modified Jul 11 at 0:05 Inuyasha Yagami 1,844

7

votes

1

answer

324

views

Reduction to a parameterized problem

undecidability

modified Jul 24 at 9:55 Chi Pong 71

4

votes

1

answer

170

views

A formal definition for amortized time

data-structures amortized-analysis

answered Jul 4 at 16:25 Yuval Filmus 256k

5

votes

1

answer

91

views

Is halting problem for /// solvable assuming programs that maches the regex “^/[ab]/[ab]/[ab]*$”?

halting-problem

answered Jul 5 at 9:51 user41805 278

-1

votes

1

answer

80

views

how can turing machines be universal models of computation if they can't perform binary search?

turing-machines turing-completeness binary-search

modified Jul 15 at 11:36 Steven 17.6k

1

vote

2

answers

116

views

edge-coloring and vertex-coloring reduction problem

graphs data-structures computability reductions

answered Jul 23 at 8:57 Steven 17.6k

-3

votes

2

answers

102

views

Is this solution for the Turing's “halting” problem correct?

algorithms turing-machines computability decision-problem halting-problem

modified Jul 5 at 4:45 rici 9,261

3

votes

2

answers

78

views

Is there a good algorithm to divide two integers without using division directly?

algorithms reference-request arithmetic

modified Jul 25 at 3:46 Rodrigo de Azevedo 818

1

vote

2

answers

161

views

What kind of binary compatibility is present for 2 processors sharing an Instruction Set?

computer-architecture compilers instruction-set

modified Jul 23 at 7:08 Shashank V M 427

1

vote

3

answers

59

views

A non-CFL over {a,b,c} with a non-CFL complement?

formal-languages context-free context-sensitive

answered Jul 26 at 17:05 Hendrik Jan 25.8k

1

vote

2

answers

121

views

Reduction from vertex-coloring problem to edge-coloring problem

complexity-theory computability np-complete reductions

modified Jul 22 at 12:41 Peter Mortensen 156

0

votes

2

answers

73

views

Kth largest element of a Min Heap of size K is always root element

binary-trees heaps

modified Jul 14 at 12:32 Rostami.M 1,374

1

vote

4

answers

68

views

A beginner book on algorithms

reference-request

answered 2 days ago Brian Tompsett - 汤莱恩 1,708

1

vote

2

answers

112

views

Need the type of time complexity and its formula

algorithms complexity-theory time-complexity polynomial-time

answered Jul 25 at 9:30 Rostami.M 1,374

2

votes

2

answers

85

views

Satisfiable CNFs where each clause contains logarithmically many different literals

complexity-theory logic probability-theory polynomial-time

answered Jul 16 at 15:38 Yuval Filmus 256k

5

votes

1

answer

79

views

Reduction from the SAT problem to the NAE-SAT problem

complexity-theory computability reductions np satisfiability

answered Jul 26 at 6:48 Shaull 15.6k

0

votes

1

answer

99

views

How to determine the approximation factor for greedy vertex cover algorithm?

approximation greedy-algorithms vertex-cover

modified Jul 19 at 7:08 Long Nguyen 238

0

votes

2

answers

87

views

Can't understand the $O$ notation for runtime of algorithms

algorithms big-o-notation

modified 2 days ago zkutch 1,754

1

vote

2

answers

65

views

prove/disprove regularity of languages

formal-languages regular-languages

answered Jul 8 at 21:59 Hendrik Jan 25.8k

1

vote

1

answer

65

views

Yao's min-max theorem: how can the set of deterministic algorithms be finite?

randomized-algorithms

answered Jul 11 at 21:22 D.W.♦ 133k

2

votes

1

answer

49

views

Does MIP* = RE's major breakthrough mean quantum computers are more powerful than turing machines?

complexity-theory computability

modified Jul 2 at 22:36 cminge 66

2

votes

1

answer

80

views

Unit conversion - Better to divide by an integer or multiply by a double?

floating-point

modified Jul 9 at 21:26 Andrea Nardi 198

5

votes

1

answer

77

views

Find all $k$ such that $X_1+kY_1,\ldots,X_n+kY_n$ are all equivalent modulo $M$

algorithms

modified yesterday John Omielan 121

-1

votes

2

answers

59

views

Is this grammar well-defined? How do I prove the language generated by it is regular?

formal-languages regular-languages automata

answered Jul 6 at 15:37 rici 9,261

0

votes

1

answer

97

views

data transfer minimization problem

algorithms graphs network-flow

modified Jul 15 at 10:14 Steven 17.6k

2

votes

2

answers

57

views

Efficient Algorithm to Find the Closest Integer Representation, in the Form $A\times\frac{N}{D}$ for a Value

algorithms integer-programming integers numerical-algorithms constraint-satisfaction

modified Jul 6 at 15:10 greybeard 871

0

votes

1

answer

118

views

Four Queens Problem to a Conjunctive Normal Form

boolean-algebra

modified yesterday HEKTO 2,820

0

votes

2

answers

33

views

In what stage is next PC address available or known to the processor?

computer-architecture

answered Jul 18 at 12:06 gnasher729 22.9k

1

vote

0

answers

145

views

Fixed Parameter Tractable for Special Vertex Cover using ILP

linear-programming integer-programming vertex-cover

modified Jul 7 at 9:05 se718 295

Top Questions

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