Hello, How do i configure my grub so that i can start running a program of my intrest without loading the operating system. In the info page of grub it is...
Hi, ... I couldn't help noticing that someone using the handle 'jackop' has been posting problems from Sipser chapter 9 in several different forums recently,...
Hi, all guys.I have a problem below: there are many manhattan polygons in a box, and space in them regarded as occuppied already. Now we want to find the...
... Linear in what? You're not very precise with your problem statement. At first sight [0] a generic sweep style algorithm would to the trick. Only occupied...
Hi Nima, ... I think your corollary should be that R is NP-hard, not NP-complete. I happened, just by coincidence, to be looking at this problem in Lewis and...
Hello frnds can any one of you suggest me some sites(softwares) that have C programming for Robotics with simulation..ie.,if i write a program in C for...
Thanks for your advice. And I mean my algorithm has linear average-time complexity with the number of the polygons. I am sure its performance analysis is...
Hi all, The 2nd edition of Sipser's "Introduction to the Theory of Computation" text was released a couple of weeks ago, and I've been browsing through a copy....
Hello Ya, a kernel is needed to attend system calls. So what entry should i add to grub menu so that system loads the minimal things required for running of my...
Thanks for the useful review, Ken. Speaking as a person who just visited Sipser's web site within the last 2 weeks, I'm a bit astonished at the lack of...
... Hi, Nandu. If you have a specific robotic platform in mind, it may come with its own simulation software. The first robot I ever messed with was a Nomad...
Hi Kurt Thanks for the solution. You solution is absolute correct. I can formalize your solution as follows: Let Q be a CNF formula with n variables. We...
hi Can anyone help me solve this question: Let ALLREX = { R | R is a regular expression whose language is all strings over {0,1}, L(R)=(0+1)^* } Prove that...
Hi Jack, ... Okay, I've been putting this off long enough. I was able to get a copy of the Baker, Gill, and Solovay paper, and I have to confess that I read...
Hi everyone. I remembered I tried to solve this a while ago. Never confirmed whether my proof was correct or not, but here is the outline of the proof. I can...
Hi guys I have an urgent question as follows: if Nr and Ns are two NFAs, How can we construct ( in polynomial time) an NFA M such that M accpets all strings...
Hi guys Please help me give a solution for the following question.. Let Sigma={1}. We can express numbers using unary notation. For example , the number 5...
This is a regular language. To prove this assume that the twin primes conjecture is true and show that L is regular, then assume that the twin primes...
{0*1*} is trivially in P If P = NP Everybody in the set NP is NP-complete because since you can solve everybody in polynomial time, you can also reduce any...
... If P = NP then all problems in NP are solvable in polynomial time. You need only construct a poly-time reduction from any problem in NP to {0*1*}. What...
hi sterni First of all i would like to thankQ for ur excellent answer it was very awesome solution.. i would like post another question to the group QUESTION...
Hi everyone, The more I think about the Baker, Gill, Solovay paper, the more amazing it seems to me. This article is generally credited with dooming...
... And ... simulation ... paper, ... steep. ... Maybe you would like to switch to the main result directly? (Looks like it is faster to go through the main...
Hi Tony, ... Yes, indeed. I should mention that this paper is very well written and appears to be quite readable. It should be available at citeseer, but...
Dear All, my name is Salvador Venegas-Andraca, and I have been a member of this group for a while. I am now writing up my PhD thesis (Quantum Computation), and...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
