Find answers to your questions about Computer Science or help others by answering their Computer Science questions.
Assume for the regular knapsack problem we have additional information - maximal weight of every item - lets denote it as P. Using this information, I want to solve the...
Asked on 11/28/2021 by user2207686
1 answerLet $Sigma$ be an alphabet and let $L$ be a language over it with the following properties:if $win L$ then there exists $vin Sigma^*$ such that...
Asked on 11/28/2021
0 answerI can very clearly see "why" mu-recursion is a universal model of computation, i.e. why the Church-Turing thesis -- that any physically computable algorithm can be executed with mu-recursion --...
Asked on 11/28/2021
2 answerAre there polynomial-time algorithms whose input is global but output is local in nature? What I have in mind is a problem instead of an algorithm. It’s the satisfiability (SAT)...
Asked on 11/25/2021
0 answerFor example, a valid number would be 6165156 and an invalid number would be 1566515. I have tried many times to construct a finite state machine for this with no...
Asked on 11/25/2021 by Hish
2 answerI'm looking for an $NP$-hardness proof for the following variant of $SAT$: $$EVEN-SAT = {langle phi rangle: phi text{ has an even number of satisfying assignments}}...
Asked on 11/23/2021 by Zur Luria
2 answerWhile reading Compilers by Alfred Aho, I came across this statement:The problem of generating theoptimal target code from a source program is undecidable in general.The Wikipedia entry on optimizing...
Asked on 11/23/2021 by Stephen Mwangi
5 answerPlease forgive me if this question is trivial, I couldn’t come up with an answer (nor finding one). In order to show that there are boolean functions $f :...
Asked on 11/23/2021 by Judy L.
1 answerHow do we uncurry functions when they are polymorphic? For example, is it possible to uncurry the following types? If so what is the uncurried type?$forall X. X rightarrow...
Asked on 11/21/2021
3 answerSuppose, we want to rearrange all possible $n$-bit binary strings (i.e., we have $2^{n}-1$ possible strings) in a 1-D array $X$; given that stings with smaller ...
Asked on 11/21/2021 by user3862410
0 answerGet help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP