Hottest Questions Today

0

votes

0

answers

14

views

reference that minimum makespan on identical machines is NP-hard?

asked 4 hours ago dpdp 21

0

votes

1

answer

17

views

Computational Complexity of an 'equivalent' 3SAT instance problem

answered 4 hours ago Steven 19.5k

4

votes

1

answer

211

views

Optimal stacking of bricks

algorithms

answered 9 hours ago Yuval Filmus 259k

0

votes

0

answers

12

views

Check if the given satisfying assignment of CNF formula is lexicographically the first

complexity-theory time-complexity np-complete satisfiability

asked 5 hours ago halw 1

0

votes

0

answers

21

views

Alu architecture

computer-architecture logic arithmetic cpu digital-circuits

modified 7 hours ago Hynisel 1

-2

votes

0

answers

11

views

While reading algorithm I came across this teminology of giving subscript to some array what does that mean?

algorithms

modified 6 hours ago Gaurav Chaudhari 1

0

votes

0

answers

28

views

master theorem `case 3` counter example? [duplicate]

algorithms complexity-theory

modified 1 hour ago mahmed nabil 1

0

votes

0

answers

13

views

Computer Science, Theory of Computation [closed]

complexity-theory reductions decidability

asked 8 hours ago Root Shaw 1

-1

votes

0

answers

24

views

Asymptotic relation between $x^2\log x$ and $x\log(x^4)$

big-o-notation

modified 9 hours ago Yuval Filmus 259k

0

votes

0

answers

28

views

in a Turing machine does allowing a mutable transition function make it more powerful?

turing-machines

modified 8 hours ago raoof 107

0

votes

0

answers

41

views

Algorithm to seat people at tables given who they would like to sit next to

algorithms

modified 9 hours ago Yuval Filmus 259k

2

votes

0

answers

15

views

Algorithm to find the shortest path and its length for moving between many geometries

algorithms computational-geometry shortest-path

modified 12 hours ago ericgcc 21

1

vote

1

answer

120

views

A computable language with a non-computable language that is prefix-free

formal-languages computability

modified 21 hours ago Addem 225

11

votes

8

answers

2k

views

Can any known sub-Turing-complete model of computation enumerate precisely the set of prime numbers?

computation-models turing-completeness enumeration primes

answered 8 hours ago gnasher729 23.6k

0

votes

0

answers

12

views

Inverse DCT using inverse DFT algorithm [closed]

algorithms signal-processing fast-fourier-transform

asked 14 hours ago math101 1

-2

votes

2

answers

47

views

Prove that the class of regular languages is closed under three operation

formal-languages regular-languages finite-automata closure-properties

answered 7 hours ago Hendrik Jan 26.2k

-1

votes

1

answer

48

views

Quasilinear time algorithm for 3-SAT

complexity-theory time-complexity np-complete satisfiability 3-sat

modified 8 hours ago Rodrigo de Azevedo 858

0

votes

0

answers

32

views

AVL implementation example question

avl-trees

modified 11 hours ago chjeseandtomato 1

-1

votes

2

answers

62

views

Is it possible to build a computer whose "ALU" is a single NAND gate?

computer-architecture cpu

modified 8 hours ago Rodrigo de Azevedo 858

0

votes

1

answer

241

views

Best algorithm to find "deepest" interval

algorithms time-complexity intervals

answered 2 days ago DMGregory 281

0

votes

0

answers

29

views

Algorithm for the Minimal Vertex Cover that is a Subgraph [closed]

graphs vertex-cover subgraphs

asked yesterday E Tam 101

1

vote

1

answer

22

views

Embedding from $L^\infty$ space to $L^2$ space

approximation euclidean-distance

answered yesterday Yuval Filmus 259k

0

votes

0

answers

25

views

What is the height growth speed of an AVL tree? [closed]

avl-trees

modified yesterday cheeseandtomato 1

0

votes

1

answer

13

views

Are AVL&RB Trees without additional storage for balance information in each node feasible?

binary-trees balanced-search-trees avl-trees red-black-trees

modified yesterday greybeard 909

2

votes

0

answers

37

views

How does the Bitcoin Algorithm for Converting to Base 58 Work?

base-conversion

asked yesterday devbanana 121

-1

votes

1

answer

58

views

Dynamic programming in optimal control

dynamic-programming linear-programming optimal-strategy

modified 21 hours ago John L. 27k

-1

votes

1

answer

28

views

what is the time complexity of this for for for if

time-complexity

answered yesterday user206904 292

0

votes

0

answers

19

views

How do websites verify that an email exists during the registration process?

computer-networks

asked yesterday user144536 1

0

votes

1

answer

18

views

can similarity transformation be linear transformation?

linear-algebra space-analysis computer-graphics

modified yesterday DMGregory 281

0

votes

0

answers

19

views

Question about machine learning

machine-learning functional-programming vc-dimension

asked yesterday Haham 21

-1

votes

2

answers

80

views

Proof of a logical theorem

logic propositional-logic

answered 2 days ago Yuval Filmus 259k

0

votes

1

answer

26

views

Prove the class of regular languages is closed or not closed under the operations below

regular-languages automata finite-automata closure-properties

answered 2 days ago Nathaniel 3,744

0

votes

0

answers

17

views

Computer network graph design

graphs data-structures probability-theory

asked yesterday JoshHalas 103

1

vote

0

answers

18

views

Discounted Optimal Stopping

dynamic-programming optimal-strategy

asked 2 days ago Williamwyn 47

1

vote

2

answers

35

views

PDA with multiple element access - $i$ - access PDA

formal-languages context-free formal-grammars pushdown-automata

answered 2 days ago Hendrik Jan 26.2k

0

votes

1

answer

32

views

Language and Decidability Problems for Turing Machines

turing-machines

answered 2 days ago Reijo Jaakkola 176

0

votes

1

answer

29

views

Size of minimal DFA

formal-languages regular-languages finite-automata

modified 2 days ago Nathaniel 3,744

-1

votes

0

answers

28

views

Learning Java (for data structures and algorithms)

algorithms data-structures java books

asked 2 days ago Mah 99

2

votes

1

answer

40

views

What is an O(n)-approximation?

algorithms complexity-theory algorithm-analysis approximation

modified Oct 22 at 8:24 Yuval Filmus 259k

1

vote

1

answer

53

views

Find if it's possible to partition a set into 3 disjoint sets each with same sum

algorithms dynamic-programming

modified Oct 22 at 11:18 Inuyasha Yagami 3,053

3

votes

2

answers

66

views

Algorithm that finds a matrix with a specific number of 1s in its rows & columns

algorithms greedy-algorithms matrices

modified Oct 22 at 2:14 narek Bojikian 3,898

3

votes

1

answer

45

views

N points with maximum sum distance

algorithms graphs runtime-analysis computational-geometry matrices

answered Oct 22 at 8:07 Yuval Filmus 259k

2

votes

1

answer

38

views

+100

prove that 2 collection have the same VC-dimensions

machine-learning vc-dimension

modified 2 days ago greybeard 909

2

votes

1

answer

29

views

Intuitive proof that all planar graphs are disk contact graphs

correctness-proof planar-graphs

answered Oct 22 at 10:30 Yuval Filmus 259k

0

votes

1

answer

24

views

Why is a regex search less efficient than a normal search?

algorithms search

answered Oct 22 at 8:55 kutschkem 391

1

vote

1

answer

20

views

Do Adjacency Lists from Binary Trees go both ways?

graphs binary-trees adjacency-matrix

answered Oct 22 at 10:51 Hendrik Jan 26.2k

0

votes

0

answers

40

views

What is related to the no of instructions a CPU can handle at one time?

cpu

modified Oct 22 at 6:24 greybeard 909

0

votes

1

answer

21

views

Finding the homomorphism between two homomorphic graphs: what is the name of this problem?

complexity-theory graphs

modified Oct 22 at 7:22 Pseudonym 16.7k

Top Questions

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