-
Return s after removing the outermost parentheses of every primitive string in the primitive decomposition of s.--leetcode question
-
We need a Tucker implementation as well, preferable a generalized one. I have not found any good code links yet, beyond looking at existing libs.
-
Hi there,
Awesome work, I just have a couple of questions on the metrics.py
Currently I believe the scale extraction and the rotation extraction are done incorrectly. Based on https://math.stack…
-
Hello, I find that your code seems to have no parts about bitplane decomposition, AAC and ACR. Have you realized them after this code? I am studying this paper and have some questions about these thre…
-
### Required prerequisites
- [X] Search the [issue tracker](https://github.com/NVIDIA/cuda-quantum/issues) to check if your feature has already been mentioned or rejected in other issues.
### Descri…
-
I'm working on example now that looks like
amp_Gaus(x | mu, sigma) + (1-amp)_Uniform(x)
```
true_amp, true_mass, true_width = .2, 0., 0.3
amp = theano.shared(true_amp)
mass = theano.shared(true_ma…
-
I believe there is an error when you try to process raw data in the command line:
```
import pyanthem
g = pyanthem.run(display=False)
Welcome to pyanthem v1.2.3!
♫ g.process_r…
-
Implement projection to homology classes via local iFFT
```
H(x) = sum_k h(k) x(k)
where x(k) = prod_i ei^(ki xi)
```
This extends the representation of local observables as polynomials in the bina…
-
Hi,
I just found this wonderful presentation from 2017: [Automatic Logic-based Benders Decomposition with MiniZinc](https://optimise.amsi.org.au/wp-content/uploads/sites/52/2017/07/stuckey-peter-uo…
-
Incorporate alternative PAH decompositions.