Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in
Toggle navigation
Menu
Open sidebar
Martin Jonáš
DTEDI
Commits
e5708327
Commit
e5708327
authored
Sep 03, 2016
by
Martin Jonáš
Browse files
Reference complexity
parent
dc84792d
Changes
2
Hide whitespace changes
Inline
Side-by-side
Chapters/Chapter02.tex
View file @
e5708327
...
...
@@ -855,6 +855,7 @@ reduces to finding values $a$ and $b$.
\section
{
Computational complexity of bit-vector logics
}
\label
{
sec:complexity
}
The propositional satisfiability problem is well known from the
computational complexity perspective, as it is the first problem that
was shown to be
\NP
-complete. The complexity of the satisfiability
...
...
Chapters/Chapter04.tex
View file @
e5708327
...
...
@@ -66,11 +66,11 @@ hybrid approach and its evaluation on the representative set of
benchmark is expected.
\subsection
{
Complexity of BV2
}
As was explained in section
???, the precise complexity of quantified
bit-vector formulas with binary-encoded
bit-widths and without
uninterpreted functions is not known. It is
known to be in
\EXPSPACE
and to be
\NEXPTIME
-hard. However, a class
for which the problem is
complete is not known.
As was explained in section
\ref
{
sec:complexity
}
, the precise
complexity of quantified
bit-vector formulas with binary-encoded
bit-widths and without
uninterpreted functions is not known. It is
known to be in
\EXPSPACE
and to be
\NEXPTIME
-hard. However, a class
for which the problem is
complete is not known.
Acording to our investigation, it is probably complete for neither of
those complexity classes. We are working on a proof which shows that
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment