TransWikia.com

Questions Tagged with "complexity classes"

Explore solved questions tagged with "complexity classes" or help others by answering their unsolved questions related to "complexity classes".

Problem with proving that $RP subseteq NP$ : a non-deterministic TM for a language $L in RP$

1 answer

Computer Science Asked 2 years ago by Pedro Costa

PPAD and Quantum

2 answer

Theoretical Computer Science Asked 3 years ago

Is mathematical proof itself NP-hard?

1 answer

Theoretical Computer Science Asked 3 years ago

Complexity of approximating a real function using queries

1 answer

Theoretical Computer Science Asked 3 years ago

Nondeterministic polynomial time algorithm versus certificate/verifier for showing membership in NP

1 answer

Computer Science Asked 3 years ago by Atsina

Conway's Game of Life: Is it really P-complete?

1 answer

Computer Science Asked 3 years ago by fluffysheap

Can map-reduce speed up the count-min-sketch algorithm?

1 answer

Computer Science Asked 3 years ago by Pragya

Maximization problem on finite collection of finite sets

1 answer

Computer Science Asked 3 years ago by yuezato

Do there exist fast multiplication algorithms for two integers with one of them being static?

1 answer

Computer Science Asked 3 years ago by John Flemin

Convert the given NFA to DFA

2 answer

Computer Science Asked 3 years ago by Vinay Varahabhotla

Ask a Question

Get help from others!

Recent Answers

Recent Questions

Categories

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP