Theoretical Computer Science Stack Exchange

1 vote

0 answers

9 views

Complexity of finding solutions to $k$SAT formulas with many assignements

user3095304

111

asked 4 hours ago

0 votes

0 answers

7 views

Is the depth of a Binary Decision Diagram independent on the variable ordering?

J. T. R.

41

asked 4 hours ago

0 votes

1 answer

1k views

Definition of $k$-Set Cover

Jan Johannsen

4,847

modified 11 hours ago

2 votes

0 answers

48 views

Improving reachability checks in a sparse, transitive-reduced causal DAG

Vinicius dos Santos

1,868

modified yesterday

4 votes

2 answers

412 views

Most general form of SAT which is in P

Vinicius dos Santos

1,868

answered yesterday

1 vote

1 answer

128 views

Lower bound for undirected graph connectivity

Neal Young

11.6k

answered 2 days ago

4 votes

1 answer

316 views

For which values of $k$ is minimum length undirected $k$-disjoint-paths in $\mathcal{P}$?

The Amplitwist

119

modified 2 days ago

1 vote

1 answer

108 views

Why is there no literature regarding complexity classes with the iterated logarithm as the bound?

Sariel Har-Peled

9,666

answered 2 days ago

2 votes

1 answer

93 views

Uniformity of threshold circuits for sorting n bit numbers

Banned AI Spammer

1

answered 2 days ago

-2 votes

0 answers

82 views

$BPL$ vs $NC^2$ and $SC^2$

Turbo

13.5k

modified 2 days ago

3 votes

1 answer

78 views

Greedy algorithm for Tree Augmentation

Neal Young

11.6k

answered 2 days ago

4 votes

0 answers

115 views

Can we turn Miller-Rabin primality testing into a deterministic algorithm?

Weier

453

asked May 6 at 11:23

0 votes

2 answers

164 views

Any arithmetic circuit of size $s$ and depth $\Delta$ can be converted to a formula of size $s' \leq s^{\Delta}$

CommunityBot

1

modified May 6 at 8:04

24 votes

3 answers

1k views

Decidability of diophantine equations over {=, +, gcd}

Guillermo A. Pérez

3

modified May 6 at 7:37

Stack Exchange Network

Explore our questions

Complexity of finding solutions to $k$SAT formulas with many assignements

Is the depth of a Binary Decision Diagram independent on the variable ordering?

Definition of $k$-Set Cover

Improving reachability checks in a sparse, transitive-reduced causal DAG

Most general form of SAT which is in P

Lower bound for undirected graph connectivity

For which values of $k$ is minimum length undirected $k$-disjoint-paths in $\mathcal{P}$?

Why is there no literature regarding complexity classes with the iterated logarithm as the bound?

Uniformity of threshold circuits for sorting n bit numbers

$BPL$ vs $NC^2$ and $SC^2$

Greedy algorithm for Tree Augmentation

Can we turn Miller-Rabin primality testing into a deterministic algorithm?

Any arithmetic circuit of size $s$ and depth $\Delta$ can be converted to a formula of size $s' \leq s^{\Delta}$

Decidability of diophantine equations over {=, +, gcd}

Hot Network Questions