My Computer Forum Computer Science Forum

Go Back   My Computer Forum > Computer Science Forum > Theory of Computation

Theory of Computation Theoretical Computer Science - Automata Theory, Computability Theory, and Computational Complexity Theory


Reply
 
LinkBack Thread Tools Display Modes
September 17th, 2012, 07:20 AM   #1
 
Joined: Sep 2012
Posts: 1
Complexity Question

Hi,

Does anyone know where can i find out what is the complexity of the "matching with mismatches" problem(A.K.A k-mismatch problem). Is it an NP-hard problem or not ?

And what is the difference between: "matching with mismatches" and "parametrized matching with mismatches" ?

Thank you

baxy
baxy is offline  
 

My Computer Forum is free to register and we welcome everyone!

Reply

  My Computer Forum > Computer Science Forum > Theory of Computation

Tags
complexity, question



Thread Tools
Display Modes


Similar Threads
Thread Thread Starter Forum Replies Last Post
C++ question...awesome question....challenging too !!! Vishal Srinivas Programming 2 November 5th, 2018 09:52 AM
Help with complexity Pusik Algorithms 5 July 1st, 2008 07:30 AM





Copyright © 2018 My Computer Forum Forum. All rights reserved.