user avatar
user avatar
user avatar
Thomas Klimpel
  • Member for 10 years
  • Last seen this week
13 votes

Is there a computationally reasonable algorithm for generating a set of polygons from a set of 2d points?

12 votes
Accepted

Literature about a naive approach to graph isomorphism by inspecting polynomials of adjacency matrices

10 votes
Accepted

Smallest class of automata model whose corresponding language class contains CFL and is closed against (dis)allowing nondeterminism in the model

10 votes

What would be the real-world implications of a constructive $P=NP$ proof?

9 votes
Accepted

Is there a data-structure for semilattices similar to a tree data-structure?

9 votes

Which research languages have a stronger typesystem than Haskell and why?

9 votes

Reference book for Parallel Computing and Parallel algorithms.

8 votes

Solve parity game in polynomial time?

8 votes
Accepted

Is a LBA with stack more powerful than a LBA without?

8 votes
Accepted

What was going on before PAC learning

6 votes
Accepted

Will floating point code return the same arithmetical results on two different computers?

6 votes
Accepted

What are appropriate isomorphisms between formal languages?

6 votes

How to prove P$\neq$NP?

6 votes

Reference request: Category theory as it applies to type systems

6 votes

What does "AC0 many-one reduction" mean?

5 votes

Theoretical machines which are more powerful than Turing machines

5 votes
Accepted

What's the difference between Adaptive Control and a Kalman Filter?

5 votes
Accepted

Relationship between formal system and formal languages

5 votes

Lowest common ancestor similar algorithm for a graph

4 votes

Has there been any more progress on P vs. PSPACE compared to P vs. NP?

4 votes

Mathematical optimization on a noisy function

4 votes

Non-erasing Turing machines and loss of generality

4 votes

Subgraph isomorphism reduction from the Clique problem

4 votes
Accepted

NP with a parallelism model?

4 votes

Relationship of algorithm complexity and automata class

4 votes
Accepted

Have non-regular language classes of infinite words been studied?

4 votes
Accepted

in refutation (resolution) can we use a clause that have been resolved

4 votes

What are the examples of problems which first had large polynomial time complexity algorithms but later the complexity was reduced significantly?

3 votes

Is every undecidable language reducible to any other undecidable language?

3 votes
Accepted

Is there a generic way to parallelize algorithms?