Computer Science
D Left Adjoint to U's user avatar
D Left Adjoint to U's user avatar
D Left Adjoint to U's user avatar
D Left Adjoint to U
  • Member for 9 years, 3 months
  • Last seen more than a month ago
Profile Activity
Stats
473
reputation
3k
reached
0
answers
24
questions
Communities
View all
About

Amateur mathematician. Software developer.

Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
11
bronze badges
Top tags
View all tags
0
Score
10
Posts
42
Posts %
0
Score
6
Posts
25
Posts %
0
Score
5
Posts
21
Posts %
0
Score
5
Posts
21
Posts %
0
Score
4
Posts
17
Posts %
0
Score
3
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
9
Can an Earley Parser be made into a fuzzy parser similar to the Levenshtein Automata Algo for DFA?
Jul 30, 2015
question
4
How does Earley parsing using an automaton work?
Dec 25, 2013
question
3
Closure of context-sensitive languages under inverse language substitution
May 30, 2021
question
2
Do you know of a brute-force algorithm for optimizing polynomial expressions? [closed]
Apr 21, 2014
question
2
If you have a smallest grammar approximation, do you immediately have a CFG inference algorithm?
Jan 11, 2019
question
2
Do graphs with a bounded number of incident edges have a polynomial-time subgraph-isomorphism algorithm?
Sep 24, 2021
question
2
Why can't 3-SAT be solved efficiently if you convert all clauses (x ∨ y ∨ z) into (u ∨ z) by introducing a variable?
Aug 16, 2022
question
1
Complexity of general polynomial map evaluation is polynomial?
Apr 19, 2014
question
1
How do you solve a general linear diophantine equation in polynomial time (with minimization constraint)?
Aug 1, 2019
question
1
Why is there no "traditional"-mathy way to describe the general algorithm and give a more math-friendly definition of algorithm?
May 12, 2021
Top network posts
View all network posts
63
Is it not effective to learn math top-down?
44
What is integration by parts, really?
37
Under the Curry-Howard correspondence or loosely "proofs-as-programs", do we also have "programs-as-proofs" and what would some arb. program prove?
24
Every natural number is covered by consecutive numbers that sum to a prime power.
19
$\partial (A \cap B) = \partial A \cap \partial B $?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.