News for hackers. Stuff that matters.

A comment on An Introduction to Geometric Algebra. Parent comment

Re:An Introduction to Geometric Algebra by petters on Thursday December 22, 2016 @04:53PM (#13240705)
Which NP tasks? ("Some" NP tasks are already possible in polynomial time)
[ Parent | on HN ]
Re:An Introduction to Geometric Algebra by trashtoss on Thursday December 22, 2016 @05:03PM (#13240776)
Seconding the question because I want to see the encodings.

Intuitively this makes sense: in the GA formalism a "single" term requires 2^n fields (where n is the spatial dimension), and "simple" operations like addition and multiplication thus require 2^n (or more) operations to evaluate.

If you could instead somehow do those operations in O(1) time you would clearly pick up a rather nice speedup, but again I'm curious what the problems and encodings (as GA) actually look like.

[ Parent | on HN ]
Re:An Introduction to Geometric Algebra by trashtoss on Thursday December 22, 2016 @05:56PM (#13241151)
Actually easy to find, for example here: https://members.loria.fr/RSchott/staceyredujanv08.pdf .
[ Parent | on HN ]
Re:An Introduction to Geometric Algebra by macawfish on Thursday December 22, 2016 @09:03PM (#13242206)
Yup, that's what I was thinking of.
[ Parent | on HN ]
Re:An Introduction to Geometric Algebra by macawfish on Friday December 23, 2016 @09:56AM (#13244991)
This paper mentions the Hamiltonian cycle problem for graphs: https://members.loria.fr/RSchott/staceyredujanv08.pdf
[ Parent | on HN ]
Re:An Introduction to Geometric Algebra by ajamesm on Thursday December 22, 2016 @06:34PM (#13241453)
Is this a genuine question, or are you trying to be blasé about employing the Socratic Method on HN?
[ Parent | on HN ]