Computer Science Stack Exchange

0 votes

1 answer

1k views

Finding all unique paths from a source to a sink in a specially-formed DAG

CommunityBot

1

modified 2 hours ago

1 vote

1 answer

63 views

Getting something wrong while building parse table for the grammar

CommunityBot

1

modified 3 hours ago

0 votes

0 answers

10 views

Relationship between $\omega$ and o

D. S.

101

asked 4 hours ago

1 vote

2 answers

4k views

If A is polynomial-time reducible to B and B is NP-Complete, can I say that A is NP-Complete as well?

shivams

101

answered 5 hours ago

0 votes

1 answer

13 views

To show that, nlogn + nloglogn is \Theta{logn} ? Is the question even correct?

SilvioM

1,121

answered 6 hours ago

1 vote

1 answer

13 views

Number of leaves in complete binary tree

Hendrik Jan

30.7k

answered 6 hours ago

0 votes

1 answer

109 views

How to calculate error bounds for the function behind the following algorithm?

CommunityBot

1

modified 6 hours ago

0 votes

1 answer

7 views

Deciding whether a linear combination of logarithm of primes is positive

gnasher729

31.1k

modified 8 hours ago

1 vote

0 answers

17 views

DLOGTIME sequential access (uniformity conditions for circuits)

emesupap

193

modified 8 hours ago

22 votes

3 answers

1k views

Basis sets for combinator calculus

John Tromp

101

answered 9 hours ago

2 votes

1 answer

34 views

Prove that $\Sigma_{i}\text{SAT}$ is a complete problem for $\Sigma_{i}^{p}$

Holaz

11

modified 10 hours ago

3 votes

1 answer

109 views

Evaluating predicate on binary strings

CommunityBot

1

modified 10 hours ago

2 votes

2 answers

62 views

Is there any way to program a chess bot which never loses?

Math-E-Mad-X

73

answered 11 hours ago

10 votes

1 answer

200 views

Using naturality to prove $f: \forall\alpha. \alpha\times\alpha\to\alpha$ must be a projection

CommunityBot

1

modified 14 hours ago

Stack Exchange Network

Explore our questions

Finding all unique paths from a source to a sink in a specially-formed DAG

Getting something wrong while building parse table for the grammar

Relationship between $\omega$ and o

If A is polynomial-time reducible to B and B is NP-Complete, can I say that A is NP-Complete as well?

To show that, nlogn + nloglogn is \Theta{logn} ? Is the question even correct?

Number of leaves in complete binary tree

How to calculate error bounds for the function behind the following algorithm?

Deciding whether a linear combination of logarithm of primes is positive

DLOGTIME sequential access (uniformity conditions for circuits)

Basis sets for combinator calculus

Prove that $\Sigma_{i}\text{SAT}$ is a complete problem for $\Sigma_{i}^{p}$

Evaluating predicate on binary strings

Is there any way to program a chess bot which never loses?

Using naturality to prove $f: \forall\alpha. \alpha\times\alpha\to\alpha$ must be a projection

Hot Network Questions