You have a bit vector $\langle a,b \rangle$, and I have another bit vector $\langle c,d \rangle$. We want to compute the scalar product of the two. Typically, we would need at least two multiplications and one addition ($\ell$ multiplications and $\ell-1$ additions for bit vectors of length $\ell$).
Using a certain algebraic property of some algebraic objects, we can do it using two additions and one multiplication ($2(\ell-1)$ additions and one multiplication).
I have got correctly working examples for vectors up to 6 items till now. I am working on increasing that number and getting to know the upper limit or any other limitations. So far it works for vectors over $\mathbb{R}$ not just bit vectors.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9611308574676514, "perplexity": 268.7801367782052}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-13/segments/1490218189090.69/warc/CC-MAIN-20170322212949-00662-ip-10-233-31-227.ec2.internal.warc.gz"}