Hottest Questions Today

7

votes

2

answers

416

views

Algorithms that run in polynomial time if P=NP

answered 4 hours ago Leo Ware 1

1

vote

1

answer

18

views

Trading States for Symbols with a Turing Machine

turing-machines

answered 2 hours ago Yuval Filmus 220k

1

vote

1

answer

21

views

Maximize rental income given a set of date intervals

algorithms dynamic-programming

modified 6 hours ago aryajades 1

0

votes

0

answers

15

views

Max flow problem of a connected graph

network-flow

modified 7 hours ago D.W.♦ 118k

0

votes

0

answers

27

views

Isn't every polynomial time problem an NP problem?

complexity-theory np-complete np

asked 12 hours ago Max Li 133

0

votes

1

answer

27

views

When does this algorithm fail?

correctness-proof greedy-algorithms

modified 15 hours ago JhonRayo99 89

3

votes

4

answers

89

views

Are all computer viruses man-made?

theory artificial-intelligence

answered 22 hours ago Sebastian 101

1

vote

1

answer

42

views

Can I find all the common subsequences between 2 sequences by using dynamic programming?

algorithms dynamic-programming subsequences bioinformatics longest-common-substring

answered 2 hours ago Yuval Filmus 220k

-3

votes

0

answers

25

views

Looping of Turing Machine

turing-machines

modified 16 hours ago D.W.♦ 118k

0

votes

0

answers

11

views

Verification conditions for Hoare

logic correctness-proof hoare-logic

modified 13 hours ago Brian Tompsett - 汤莱恩 1,432

1

vote

1

answer

16

views

For $T(n) = 16(T/4) + n^2\lg^3n$ prove: $T(n) = \Theta(n^2\lg^3n)$

algorithms asymptotics efficiency

modified 17 hours ago Yuval Filmus 220k

-1

votes

0

answers

13

views

Can someone help me with these ques? [closed]

programming-languages decision-problem java answer-set-programming

asked 16 hours ago Mad Lavender 1

0

votes

0

answers

26

views

Big O notation of $\left(\begin{array}{c} n\\ \frac{n}{2} \end{array} \right)$

asymptotics big-o-notation

asked 20 hours ago Eliran Turgeman 11

1

vote

1

answer

15

views

What is µ A below ~ x in the Fuzzy Logic

fuzzy-logic

answered 17 hours ago tahasozgen 33

1

vote

0

answers

14

views

Algorithm for drawing AST-es?

syntax-trees graph-drawing

asked 19 hours ago FlatAssembler 131

1

vote

1

answer

12

views

Hoare Logic for Factorial

logic discrete-mathematics hoare-logic loop-invariants

answered 18 hours ago Yuval Filmus 220k

0

votes

2

answers

28

views

Is There Any Shortest Path Algorithm That Finds The Shortest Path Between Only Two Nodes

graphs shortest-path

answered 23 hours ago BlueRaja - Danny Pflughoeft 1,107

1

vote

2

answers

188

views

Logspace algorithm for balanced parentheses problem

space-complexity

modified yesterday Yuval Filmus 220k

0

votes

0

answers

16

views

Different way of solving boolean satisfiability

logic satisfiability boolean-algebra

asked 22 hours ago komorra 101

0

votes

1

answer

23

views

Probability of data loss for mirrored,3 disk system

probability-theory database-theory

answered yesterday CodeChef 43

1

vote

1

answer

38

views

Linear programming over a finite field

reference-request linear-programming integer-programming constraint-satisfaction

answered yesterday Yuval Filmus 220k

3

votes

1

answer

41

views

Algorithm to create dense style crossword puzzles

algorithms np-hard heuristics search-problem constraint-satisfaction

modified yesterday j_random_hacker 3,735

1

vote

2

answers

44

views

Probability that two elements are compared in randomized quicksort

algorithms time-complexity probability-theory randomized-algorithms quicksort

modified 16 hours ago gnasher729 17.9k

3

votes

2

answers

33

views

Why are primitive types stored in a stack in systems level software?

memory-management memory-access stacks

answered 21 hours ago gnasher729 17.9k

2

votes

1

answer

121

views

What is the relation between parsing languages and checking languages?

formal-languages formal-grammars parsers

answered 2 days ago Yuval Filmus 220k

0

votes

1

answer

29

views

Doest sorting accept a dynamic programming solution?

sorting dynamic-programming

modified yesterday Steven 3,722

1

vote

1

answer

29

views

Prove a TM problem is NP-complete

turing-machines np-complete reductions np-hard np

answered yesterday Yuval Filmus 220k

2

votes

1

answer

22

views

on-the-fly decompress a flat-file database

information-theory data-compression huffman-coding

modified yesterday vonbrand 11.1k

8

votes

1

answer

2k

views

+50

What is wrong with this simple proof of P=NP?

complexity-theory np-complete satisfiability 3-sat

modified 2 days ago Russell Easterly 245

0

votes

0

answers

18

views

Getting started with computers [closed]

computer-architecture computer-networks security

asked yesterday nerd 1

0

votes

1

answer

14

views

Build LL(1) parsing table for grammar S -> iSeS | iS | a

formal-grammars parsers

modified yesterday grzegorzs 1

2

votes

0

answers

18

views

Simple back propagation example

machine-learning neural-networks derivation

asked yesterday lmurdock12 121

0

votes

2

answers

43

views

Can you insert into sorted list with time O(1)?

time-complexity arrays

answered yesterday Dmitri Urbanowicz 706

1

vote

1

answer

30

views

Generate all combinations of a set/array with specific conditions

algorithms arrays sets

answered yesterday 6005 2,463

0

votes

0

answers

33

views

Prove/disprove: $\frac{O(f(n))}{O(g(n))} = \frac{\Omega(f(n))}{\Omega(g(n))}$ [closed]

algorithms complexity-theory algorithm-analysis asymptotics

modified yesterday Yuval Filmus 220k

2

votes

1

answer

21

views

Properties of roots of recurrence relations in the context of exponential algorithms in order to decrease the upper bound of the running time

algorithms recurrence-relation

modified yesterday Yuval Filmus 220k

1

vote

1

answer

54

views

Knapsack Problem with exact required item number constraint

algorithms optimization knapsack-problems pseudo-polynomial

modified yesterday Steven 3,722

1

vote

0

answers

15

views

Proof of Subject-Expansion Theorem in Type Theory

type-theory

asked yesterday Gabriel F. Silva 11

0

votes

0

answers

25

views

Solving NP problems : analogy between the SAT problem and the shortest path problem

algorithms graphs computability optimization polynomial-time

asked 2 days ago dockerwonderer 1

3

votes

1

answer

46

views

Why is memory one dimensional?

arrays memory-hardware

answered 2 days ago D.W.♦ 118k

1

vote

1

answer

32

views

Bridges and Edge Disjoint Paths

graphs graph-traversal connected-components

modified yesterday John L. 21k

1

vote

0

answers

22

views

Backprop formula question

machine-learning gradient-descent

modified 2 days ago nlzxz 11

0

votes

1

answer

20

views

If there is an polynomial time approximation to an NP-complete problem, is P approximately NP?

complexity-theory time-complexity np-complete np p-vs-np

modified 2 days ago D.W.♦ 118k

-1

votes

1

answer

60

views

Merging $t$ arrays of size $t$ cannot be done in $O(t^2)$

algorithms time-complexity sorting proof-techniques recursion

modified 2 days ago Yuval Filmus 220k

1

vote

3

answers

44

views

rolling around running numbers

algorithms modular-arithmetic

answered 2 days ago Yuval Filmus 220k

1

vote

2

answers

47

views

Grid Puzzle Split Algorithm

algorithms graphs randomness square-grid

answered 2 days ago D.W.♦ 118k

1

vote

1

answer

29

views

Big O of rational function using the definition

asymptotics big-o-notation

modified 2 days ago Yuval Filmus 220k

3

votes

2

answers

494

views

What's an efficient algorithm to calculate line breaks (word wrap) for balanced widths (minimum raggedness)?

algorithms optimization performance

modified yesterday MarcG 63

Top Questions

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