Yes, that particular problem is called PRIMALITY, and is very different than factoring an integer into its primes. Testing for primeness is easier than...
... version) ... I'm not sure whether this is a point of confusion for you or not, but the decision problem and the original problem are polynomially ...
Hi, Can someone tell me a way to do the following there is a language L and a turing machine M which accpets it . There is another Language L' and another...
hi, I am searching for a paper (details given below),this paper is not available online.It would be great if someone could scan and share it. thanking you all ...
Algebraic Topology - Covering Spaces and Lifts Some of you have emailed me expressing interest in the application of topology to computing. As I've posted,...
I've converted this last post to a pdf document that takes advantage of all niceties one has in a pdf (ie: subscripts, graphics etc...). You can check it out...
... From: Kurt Van Etten To: theory-edge@yahoogroups.com Sent: Sunday, December 07, 2003 12:21 AM Subject: [theory-edge] Re: fractals & graphs Hi all, In the...
http://graphics.stanford.edu/courses/cs468-02-fall/ A good site that deals with computational topology from Stanford. If you check out the "schedule" link, it...
Dear Members, I urgently need three old computational geometry papers: 1. A. Fournier and D. Y. Montuno, Triangulating simple polygons and equivalent problems,...
for 3rd reference , I can see papers of the same symp from 1984 to 2002, but 1982 is not available Mahdi Cheraghchi Bashi Astaneh <cheraghchi@...> wrote:...
Dear "Computer Science Theory" Friends, [computer-science] is a mailing list provided as a service to the Computer Science Community, and is intended...
Hi, I have just joined this group. I learned about this group while searching the internet and I was immediately attracted to this group. I am interested in...
We are an academic research group of National Kaohsiung First University of Science and Technology in TAIWAN. To do research of knowledge management in...
... First, it's perfectly normal you find lecture notes on Computational Complexity confusing. Even after years, excellent comprehension and a solid...
Suggestion: Sipser's "Introduction to the Theory of Computation" is a good way to start if you are willing to stick with each chapter until you're able to...
After skimming through some of the earlier messages posted in this group, I realized that all the new members have introduced themselves. So I would like to...
... From: muntasir_cse_buet To: comp-sci-theory@yahoogroups.com Sent: Friday, May 07, 2004 9:38 AM Subject: [comp-sci-theory] Introducing myself After skimming...
I have heard alot about Sipser's book and I have no doubt that it is a classic text. In our last semester we completed a two credit hour course on theory of...
... Introductions to Complexity Theory all look the same. If you went through Papadimitriou's book, that should do. If you feel you need more theoretical...
Proof theory is very relevant to complexity because it studies, among others, the relative power of different proof systems. I have no references to provide,...
I've been making very good progress through Allen Hatcher's book on Algebraic Topology and everything is starting to fit together (oh, and by the way, I...
Video lectures by Mr Computer Science himself, Donald Knuth. Enjoy. http://scpd.stanford.edu/scpd/students/Dam_ui/pages/ArchivedVideoList56K.asp?Include=knuth...
Dear Muntasir, ... But you've probably heard of Recursive Fonctions Theory ? ... Handbook of proof theory [Texte imprimé] / ed. by Samuel R. Buss,.... -...
Controversial but excellent predictions for the future of the internet. Includes section with titles like "The End Anonymity". Don't worry, he does address...
hi mike, In his book "intuitive topology" ( by some russian author,University press publications), the author explains the intricacies in topology using ...