Tomáš Šíma

166 reputation

	166 reputation	bio	website		visits	member for	7 months
4 badges		location			seen	May 14 at 13:15

9 Comments

Apr 18	comment	Get polynom from polynom, roots of second one are multiplication of first one. The problem is, that c1,c2....cn are not known.
Apr 18	comment	Get polynom from polynom, roots of second one are multiplication of first one. I dont think so, can you be more descriptive please?
Apr 7	comment	transform traveling salesman problem into subgraph isomorphism problem I can call the constant time subrutine that solve graph problem polynomial times, so its not a problem. Problem is, formulating the algorithm using this subroutine.
Apr 7	comment	transform traveling salesman problem into subgraph isomorphism problem I read, that if you could solve one NP-complete problem in constant time, you can solve them all, so I think that all NP-complete problems are transferable to each other.
Apr 6	comment	Maximum number of elements, where no two are in relation its restrictive condition
Mar 16	comment	Get A⊕(B+1) from A⊕B I solve this in relation to cryptography. In my example n<=8, so the cipher can be bruteforced easily. Thanks a lot!
Mar 16	comment	Get A⊕(B+1) from A⊕B That was stupid comment, I see now.
Mar 16	comment	Get A⊕(B+1) from A⊕B Ahh, I see. Thanks! Are two different values the maximum I can get? Can I get three(or more) different values of D for one C?
Mar 16	comment	Get A⊕(B+1) from A⊕B It means XORing bit by bit, edited question