Skip to main content
apnorton's user avatar
apnorton's user avatar
apnorton's user avatar
apnorton
  • Member for 12 years, 7 months
  • Last seen more than a week ago
awarded
awarded
awarded
awarded
awarded
awarded
awarded
revised
Sort Algorithm running in O(n)
To avoid downvotes and/or closure for lack of effort/poor question format, I've made a note to make it even more obvious that this was self-answered.
Loading…
suggested
Approve
revised
Questions on Graph and Hamiltonian
Copied quote from referenced book, improved writing style (yet preserved intent), and general formatting.
Loading…
comment
Questions on Graph and Hamiltonian
@M.holi When someone says something is an "open" problem, that means that no one knows the answer yet.
suggested
Approve
awarded
revised
Loading…
comment
Is there an efficient algorithm for expression equivalence?
But, still +1, as this is closest result to the OP's problem I've seen yet.
comment
Is there an efficient algorithm for expression equivalence?
As pointed out in a comment above, the OP is not working in a finite field, but rather a commutative semiring. This means that additive inverses are not guaranteed to exist, so "subtracting" the expressions to check equality with zero is not a valid operation.
awarded
comment
Is there an efficient algorithm for expression equivalence?
You're looking at determining expression equivalence in a semiring. This is related to a Kleene algebra, which, in turn, is related to regular expressions. It might be possible to reduce this problem to determining equivalence of regexes. I'm out of my depth, but that might aid search terms.
answered
Loading…