Computer Science – Logic in Computer Science
Scientific paper
2011-05-27
Computer Science
Logic in Computer Science
Scientific paper
We give the first elementary construction of equivalent formulas in Hanf
normal form. The triply exponential upper bound is complemented by a matching
lower bound.
Bollig Benedikt
Kuske Dietrich
No associations
LandOfFree
An optimal construction of Hanf sentences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An optimal construction of Hanf sentences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An optimal construction of Hanf sentences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-664798