Computer Science Stack Exchange

3

votes

2

answers

37

views

Information-theoretic limits for a weighing puzzle

information-theory lower-bounds

answered 8 mins ago D.W.♦ 124k

1

vote

1

answer

13

views

first order logic to normal form order of operations

logic first-order-logic

answered 16 mins ago lemontree 419

3

votes

2

answers

61

views

Finding closest edge to a point in a planar graph

computational-geometry planar-graphs

modified 1 hour ago D.W.♦ 124k

1

vote

1

answer

11

views

Is the set of all context-free languages contained in the set of all languages that have a w-grammar?

context-free

answered 1 hour ago Yuval Filmus 232k

0

votes

0

answers

9

views

Is arithmetic a context free grammar?

context-free arithmetic

asked 1 hour ago theX 101

1

vote

2

answers

32

views

Need help with this runtime of algorithm with double loops that results in 0

algorithms runtime-analysis

modified 1 hour ago greybeard 716

0

votes

0

answers

12

views

divide a sorted array into k subarrays with their intervals are same and count integers in the interval without accessing the data

algorithms time-complexity sorting arrays divide-and-conquer

modified 1 hour ago rlo.ldl 1

1

vote

1

answer

36

views

Is Prediction the same as Compression?

information-theory data-compression

modified 2 hours ago orlp 9,596

1

vote

2

answers

35

views

How to prove that concatenating a language A and A* is commutative?

automata regular-languages finite-automata regular-expressions kleene-star

answered 2 hours ago plop 535

-2

votes

0

answers

10

views

How to solve connecting cities problem?

algorithms

asked 3 hours ago some dev 7

0

votes

0

answers

7

views

Inability to understand local fourier analysis in the given link

image-processing

asked 3 hours ago Sayan Barrie Mccullum 1

0

votes

1

answer

31

views

What is the polynomial time reduction between these two Hamiltonian cycle problems?

algorithms graphs reductions hamiltonian-path polynomial-time-reductions

answered 3 hours ago plshelp 607

0

votes

1

answer

43

views

PDA for $L= \{w : n_a(w)+n_b(w) = 2n_c(w)\}$

automata pushdown-automata

modified 3 hours ago Community♦ 1

0

votes

2

answers

47

views

Why this problem has such a simple solution? How would you avoid looking for more complex solutions first?

algorithms greedy-algorithms

modified 3 hours ago Lay González 127

Aug	SEP	Oct
	30
2019	2020	2021

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Information-theoretic limits for a weighing puzzle

first order logic to normal form order of operations

Finding closest edge to a point in a planar graph

Is the set of all context-free languages contained in the set of all languages that have a w-grammar?

Is arithmetic a context free grammar?

Need help with this runtime of algorithm with double loops that results in 0

divide a sorted array into k subarrays with their intervals are same and count integers in the interval without accessing the data

Is Prediction the same as Compression?

How to prove that concatenating a language A and A* is commutative?

How to solve connecting cities problem?

Inability to understand local fourier analysis in the given link

What is the polynomial time reduction between these two Hamiltonian cycle problems?

PDA for $L= \{w : n_a(w)+n_b(w) = 2n_c(w)\}$

Why this problem has such a simple solution? How would you avoid looking for more complex solutions first?

Hot Network Questions