Question

What is the equivalent of SHORT-PROOFS for PSPACE?

score 266 · Answer 1 · 2017-03-08 04:19:04

266

Views

What is the equivalent of SHORT-PROOFS for PSPACE?

Published on 08 Mar 2017 - 4:19

score 409 · Answer 2 · 2017-03-08 17:37:00

409

Views

A communication complexity problem for finding near matches

Published on 08 Mar 2017 - 17:37

score 1k · Answer 3 · 2026-03-25 09:14:21

1k

Views

Does there exist a computable function that grows faster than fast growing hierarchy?

Published on 25 Mar 2026 - 9:14

score 76 · Answer 4 · 2026-04-01 06:23:50

76

Views

A Linear Algebra Problem; functions

Published on 01 Apr 2026 - 6:23

score 1k · Answer 5 · 2017-03-11 22:46:36

1k

Views

Why is it obvious that P is contained in PSPACE and NP contained in NPSPACE?

Published on 11 Mar 2017 - 22:46

score 187 · Answer 6 · 2026-03-29 22:28:34

187

Views

Is partitioning a multiset, M, into two equal subsets equivalent to partitioning (M $\cup$ M) into four equal subsets?

Published on 29 Mar 2026 - 22:28

score 34 · Answer 7 · 2017-03-14 03:27:06

34

Views

Why is the halting language and its complement the only possible separating languages?

Published on 14 Mar 2017 - 3:27

score 168 · Answer 8 · 2017-03-14 23:18:13

168

Views

Lower bound of way found time complexity

Published on 14 Mar 2017 - 23:18

score 1.3k · Answer 9 · 2026-03-28 04:22:46

1.3k

Views

calculate the number of basic operations in a recursive algorithm

Published on 28 Mar 2026 - 4:22

score 56 · Answer 10 · 2017-03-15 14:37:33

56

Views

Is there a more efficient way to write max(Ax,min(y,Bx))?

Published on 15 Mar 2017 - 14:37

score 2k · Answer 11 · 2017-03-16 03:13:01

2k

Views

Given a prime p find a generator of $\mathbb{Z}_p ^{*}$

Published on 16 Mar 2017 - 3:13

score 353 · Answer 12 · 2026-03-26 22:13:22

353

Views

L is decidable. Prove that “similar” language is also decidable

Published on 26 Mar 2026 - 22:13

score 83 · Answer 13 · 2026-03-26 02:44:30

83

Views

RSA (FACT) to SAT transform complexity

Published on 26 Mar 2026 - 2:44

score 340 · Answer 14 · 2026-03-29 22:34:05

340

Views

Prove that PTIME has no complete problems with respect to linear-time reductions.

Published on 29 Mar 2026 - 22:34

score 1k · Answer 15 · 2026-03-29 22:33:57

1k

Views

Show that PTIME and PSPACE is closed under Klenee star

Published on 29 Mar 2026 - 22:33

List Question

What is the equivalent of SHORT-PROOFS for PSPACE?

A communication complexity problem for finding near matches

Does there exist a computable function that grows faster than fast growing hierarchy?

A Linear Algebra Problem; functions

Why is it obvious that P is contained in PSPACE and NP contained in NPSPACE?

Is partitioning a multiset, M, into two equal subsets equivalent to partitioning (M $\cup$ M) into four equal subsets?

Why is the halting language and its complement the only possible separating languages?

Lower bound of way found time complexity

calculate the number of basic operations in a recursive algorithm

Is there a more efficient way to write max(Ax,min(y,Bx))?

Given a prime p find a generator of $\mathbb{Z}_p ^{*}$

L is decidable. Prove that “similar” language is also decidable

RSA (FACT) to SAT transform complexity

Prove that PTIME has no complete problems with respect to linear-time reductions.

Show that PTIME and PSPACE is closed under Klenee star

Trending Questions

Popular # Hahtags

Popular Questions