## General algorithm to find a minimal branching program

Given a general branching program, is there an algorithm which can find an equivalent branching program $$P$$ of minimal length. That is $$|P| \leq |P’|$$ for all equivalent branching program $$P’$$.

If not, are their some specific cases where this is algorithm exists?

## Installing Ubuntu 16.04 alongside Windows 10 doesn’t find the Windows version

For university I require to install Ubuntu 16.04 as dual boot next to my windows install.

I am not getting the option install Ubuntu next to my Windows install, as it did not detect any previous installs.

I’ve checked "Install alongside" option missing. How do I install Ubuntu beside Windows using "Something Else"? and I can conclude:

• My laptop uses UEFI, secure boot is disabled
• My laptop was correctly shut down
• Hybernating is disabled
• Fast startup is disabled
• The Windows partition is not damaged
• It is not a Windows Dynamic Disk
• The Windows partition has been shrunk (I got 30GB of unused space where I want the Ubuntu install to be located, on my SSD).

As many other threads I’ve found, I can only choose between installing ubuntu as only boot, or choose something else, where I can only find my HDD and not my SSD. I think this is the reason why the installer didn’t find the Windows install, as it did only check the HDD?

Any suggestions what to try next? Is there any way to get the option install alongside windows 10?

## Creating a priority search tree to find the number of points in the range [-inf, qx] X [qy, qy’] from a set of points sorted on y-coordinates

A priority search tree can be constructed on a set of points P in O(n log(n)) time but if the points are sorted on the y co-ordinates then it takes O(n) time. I find algorithms for constructing the tree when the points are not sorted.

I figured out a way to do this as follows:

1. Construct a BST on the points. Since the points are sorted then it will take O(n) time

2. Min-Heapify the BST on the x-coordinates This will take theta(n) time

So total time complexity will be O(n)

Is this a valid approach to construct a Priority Search Tree in O(n) time??

## The Find Familiar spell describes a familiar

The Find Familiar spell description explains what a “familiar” is. It describes its properties — acts independently, can’t attack, can deliver spells, can be dismissed into a pocket dimension, etc.

The PHB uses “familiar” as a term, expanding its properties in some cases, e.g. Pact of the Chain:

Pact of the Chain
You learn the Find Familiar spell and can cast it as a ritual. The spell doesn’t count against your number of spells known. When you cast the spell, you can choose one of the normal forms for your familiar or one of the following special forms: imp, pseudodragon, quasit, or sprite.
Additionally, when you take the Attack action, you can forgo one of your own attacks to allow your familiar to make one attack of its own with its reaction.

So the Warlock’s familiar can be an imp, pseudodragon, quasit, or sprite, and it can attack.

## “Variant: Familiar” describes additional familiar properties

Notice that imp, pseudodragon and quasit all have the “Variant: Familiar” block and there are no other creatures in the MM with the “Variant: Familiar” block. That block describes additional familiar features: first one is the 1-mile telepathic link, and second one depends on the creature type (for instance, Imp gives its master the Magic Resistance trait). That block does not describe any other familiar’s properties. It doesn’t explain anything that is already described in the Find Familiar spell, and it still uses the “familiar” term. It is logical to assume that it is the same “familiar” as the PHB describes.

From my understanding, “Variant: Familiar” expands base familiar description, like the Pact of the Chain does:

1. General familiar properties are given in the Find Familiar spell description.

2. If the spellcaster is a Warlock and they chooses the Pact of Chain feature, the familiar properties are expanded, giving more potent familiar as a result.

3. The familiar properties might be expanded even more, if the familiar is Imp/Quasit/Pseudodragon and the DM uses the “Variant: Familiar” optional rule.

It goes well with the “specific beats generic” rule:

• Familiar can’t attack (generic) but it can with the Pact of Chain (specific).

• The spellcaster can share familiar’s senses within 100 feet (generic), or 1 mile with several kinds (specific), providing the DM uses the variant rule.

## So why in fact does it not?

Several answers (like this one) assume that in fact “Variant: Familiar” rule describes a sort of “another” familiar with completely different properties. It can attack, but can NOT deliver spells, and if it dies — it’s gone forever. How to obtain this familiar remains a mystery. It is still called a “familiar” though.

That seems purely homebrew for me, but is treated as official rulings. It is also being said these creatures cannot be found with the Find Familiar spell. What is the source of this assumption? What are the properties of this “another familiar”, and where they are described?

@SevenSidedDie mentioned that all “Variant: X” in the MM mean a somewhat special creature:

… a variant is just an alternative stat block for a given creature, so that it works slightly differently from the common variety of that creature.

The idea of “variants” is that, just like not every human is identical

A familiar variant of a creature is just the stat block to use for a creature that has somehow agreed to serve as a familiar for a spellcaster.

That actually supports the idea that Warlock should have the magic resistance trait from the imp, not contradicts it.

The Warlock summoned an imp as a familiar — therefore, that particular imp agreed to serve as a familiar. The DM uses the variant rule. Why shouldn’t the imp give the magic resistance trait, as the “Variant: Imp Familiar” describes?

## It is just a spirit that takes a particular form

That answer explains it that way:

the Warlock’s familiar isn’t any sort of pseudodragon, let alone one with the variant. It’s a spirit that takes the form of a pseudodragon

But that reasoning does not work with the imp. Find Familiar implies that the imp familiar is an imp:

the familiar has the Statistics of the chosen form, though it is a celestial, fey, or fiend

So a fiend can be a familiar, and Imp is a fiend.

## Find N best subset of quotations

I am faced with the following problem;

We are provided cost quotations for shipping cost per packet by various shipping companies, let’s call these quotations Q1 … Qk. Each Quotation is a M x N matrix with weights categories of packets along one axis and size categories along the other axis. We are provided with a list of packets as well with respective weights and sizes such that we can convert the packages to be shipped into a 2d matrix of size M x N as well based on categorization of each packet and each cell shall contain the relevant number of packets in that weight+size category. Let’s call this matrix P.

The total shipping cost for all the packets should we chose a shipping company ‘i’ is sum of ( Qi x P ) where ‘x’ is the element-wise multiplication of the two matrices.

We are required to find a subset of ‘w’ shipping companies (or quotations) such that the overall shipping cost is minimum.

I understand that a brute force algorithm trying out all combinations is not going to work due to the explosion of the number of combinations as ‘w’ starts to increase. Moreover, I have also convinced myself that I can not iteratively build out a solution by first selecting two best quotations, merging them into one and then continue to add one more till I reach ‘w’.

Can someone help me find the relevant class of problems and suggest a solution?

## How to create a site template and add fields to list automatically. For detailed question. Please find below

I need to first create a site template which consist of project name, description, attachments and appointment fields. Then automatically add few of their fields to the project management list.

How can I do above things like creating sie template and then automatically add few contains like project name, description to the list.

Please help me out. Sharepoint is completely new for me. I am using SharePoint 365. Your help is appreciated.

## How to find out is a current user on group

I need i find outis a current user is on the group. Is he then i could show on hide a properties. I have got this code. How to find out that current uuser is on manager group?

   let grupy = sp.web.currentUser.groups.getByName("Właściciele witryny Portal UAM").users;     console.log(grupy); 

## How to find out which program create/write a file

I want to know how a specific file is generated during the build process of a large project like AOSP. The build script is too complex to get start with, so I want to start something like a file system filter driver (this name is from Windows, I’m not sure what this is called in Linux), that can inform me when a file of a specific name (e.g. absolute_path/object.o) is created/written. Then I can setup and start the filter then start the build process and wait for the message from the file system filter driver that tells me which program creates that file during the build process.