Computer Science Stack Exchange

0

votes

1

answer

4

views

Douglas-Peucker line simplification algorithm time complexity

complexity-theory asymptotics check-my-answer

modified 44 mins ago DarK_FirefoX 137

-1

votes

0

answers

21

views

How can i show that this particular Language is Irregular?

formal-languages regular-languages

modified 53 mins ago rici 8,427

0

votes

1

answer

32

views

Need help with recurrence relation and postcondition of a function

runtime-analysis recurrence-relation recursion

modified 2 hours ago Community♦ 1

50

votes

14

answers

15k

views

Is C actually Turing-complete?

computability turing-completeness c

modified 3 hours ago polcott 159

6

votes

1

answer

236

views

Find maximal subgraph containing only nodes of degree 2 and 3

algorithms graphs approximation graph-traversal

modified 4 hours ago Community♦ 1

2

votes

1

answer

19

views

How to sort an array $A[1..n]$ where all but $\lfloor \sqrt n \rfloor$ elements are integers in range $\sqrt n$ to $n\sqrt n$, at $\Theta(n)$ time?

algorithms sorting

modified 5 hours ago Steven 15.1k

-1

votes

0

answers

19

views

I invented a blockchain consensus algorithm for permissionless network. How can the idea gain exposure if I don't know anyone from the field/industry?

distributed-systems blockchain

asked 8 hours ago the_intercon 1

10

votes

1

answer

375

views

Shift-resolve parsing - questions

algorithms formal-grammars context-free parsing

modified 9 hours ago Community♦ 1

0

votes

0

answers

11

views

Why is programmed I/O not suitable for high-speed data transfer?

computer-architecture

asked 9 hours ago ANSHUL GUPTA 13

1

vote

1

answer

15

views

Proof that class of languages accepted by DPDA by empty stack is not closed under union

formal-languages pushdown-automata closure-properties nondeterminism

answered 9 hours ago Hendrik Jan 25.2k

1

vote

0

answers

20

views

Checking correctness of grammar for $L = \{w \in \{a, b\}^* \text{ }| \text{ } w \text{ has } n_a(w) = 2n_b(w)\} $

formal-languages context-free formal-grammars

asked 9 hours ago Tom Finet 196

0

votes

0

answers

17

views

maximal independent set on grid-based graph proof of approximation ratio

np-hard approximation greedy-algorithms

modified 9 hours ago morvis 28

0

votes

1

answer

18

views

Finding values in a space that matches a relational query

algorithms

modified 10 hours ago aminrd 464

1

vote

0

answers

18

views

Combining insertion/deletion operations in Levenshtein distance

algorithms edit-distance

modified 10 hours ago zareami10 23

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Douglas-Peucker line simplification algorithm time complexity

How can i show that this particular Language is Irregular?

Need help with recurrence relation and postcondition of a function

Is C actually Turing-complete?

Find maximal subgraph containing only nodes of degree 2 and 3

How to sort an array $A[1..n]$ where all but $\lfloor \sqrt n \rfloor$ elements are integers in range $\sqrt n$ to $n\sqrt n$, at $\Theta(n)$ time?

I invented a blockchain consensus algorithm for permissionless network. How can the idea gain exposure if I don't know anyone from the field/industry?

Shift-resolve parsing - questions

Why is programmed I/O not suitable for high-speed data transfer?

Proof that class of languages accepted by DPDA by empty stack is not closed under union

Checking correctness of grammar for $L = \{w \in \{a, b\}^* \text{ }| \text{ } w \text{ has } n_a(w) = 2n_b(w)\} $

maximal independent set on grid-based graph proof of approximation ratio

Finding values in a space that matches a relational query

Combining insertion/deletion operations in Levenshtein distance

Hot Network Questions