InsideDarkWeb.com
  1. All Categories
  2. Computer Science

Computer Science : Recent Questions and Answers

Find answers to your questions about Computer Science or help others by answering their Computer Science questions.

Solving the Knapsack problem in $O(n^2P)$, where P is the maximum weight of all items

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 answer

Number of words of length n for special language

Let $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 answer

Intuition for Church-Turing thesis for Turing machines

I 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 answer

Global-input-local-output p-time algorithms

Are 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 answer

Does a regular expression exist for any number that contains no more than two 5s and no 6 twice in a row?

For 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 answer

Is $EVEN-SAT$ $NP$-hard?

I'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 answer

Proof of the undecidability of compiler code optimization

While 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 answer

Counting circuits with constraints

Please 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 answer

Uncurrying and Polymorphism

How 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 answer

Algorithm suggestion to order data with specific condition

Suppose, 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 answer

Ask a Question

Get help from others!

© 2021 InsideDarkWeb.com. All rights reserved.