Google Groups Home
Help | Sign in
sci.math
+ new post
About this group
Subscribe to this group
This is a Usenet group - learn more
Message from discussion about CNF converting
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
newbie  
View profile
  More options Oct 6 2008, 7:32 am
Newsgroups: sci.math
From: "newbie" <new...@newbie.new>
Date: Mon, 06 Oct 2008 11:32:00 GMT
Subject: about CNF converting
Reply to author | Forward | Print | View thread | Show original | Report this message | Find messages by this author
Hi all,

did somebody know if is possible to use a non
deterministic algorithm in order to convert
every boolean propositional formula into
an equivalent CNF formula?

Thanks a lot
Regards


    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2009 Google