Questions tagged [unary-languages]
The unary-languages tag has no usage guidance.
3
questions with no upvoted or accepted answers
8
votes
0
answers
135
views
Can we define a meaningful concept of exptime reductions (as opposed to polytime reductions) for classes like NEXP or NEEXP?
Typically we are only interested in polytime reductions as we are usually interested in showing a reduction from one NP-problem to another.
However, if we consider larger complexity classes such as ...
- 383
3
votes
0
answers
267
views
Take a NEXP-complete problem and then have the input in unary. Why is this not NP-complete?
It is known that if any unary language is NP-complete, then P=NP.
Suppose we take a NEXP-complete language with input $x$ in binary and witness $y\in\{0,1\}^{2^{poly(|x|)}}$ such that the verifying ...
- 383
0
votes
0
answers
126
views
Complexity classes for problems that can be solved only from the length of the input
A tally language is a language on an alphabet with only one symbol. One can define complexity classes for tally languages, such as $P_1$ (the tally languages that can be decided in polynomial time).
...
- 7,465