Hermann Gruber's user avatar
Hermann Gruber's user avatar
Hermann Gruber's user avatar
Hermann Gruber
  • Member for 13 years, 5 months
  • Last seen this week
7 votes
Accepted

Reducing the bandwidth of non-symmetric matrix

6 votes
Accepted

Alternative to LBA for recognising context-sensitive languages

6 votes
Accepted

Is an algorithm with an approximation factor of 4000 useful?

6 votes

NFA to 2DFA: what are the upper and lower bounds?

6 votes

Continuous mathematics and formal language theory

6 votes

Conjectures implying Four Color Theorem

6 votes
Accepted

How can one ACTUALLY minimize a regular expression?

6 votes

Complexity of intersection of regular languages as context-free grammars

6 votes

What are the recent TCS books whose drafts are available online?

5 votes
Accepted

minimizing size of regular expression for finite sets

5 votes

A tool for minimal NFA computation

5 votes

Open access journals

5 votes

Ordered Grammar in THEORY OF COMPUTATION

5 votes

what is a model of computation, mathematically?

5 votes
Accepted

What are those deterministic algorithms for k-SAT that are not derandomization of random algorithms like PPSZ and Schöning's local search?

5 votes

Is there any inherently ambiguous indexed language?

5 votes

Relationship between size of Boolean functions and DFAs

5 votes

Finding a minimal context free grammar that recognizes a finite set of strings of bounded length

4 votes

General collection with the current state of complexity bounds of well-known unsolved problems?

4 votes

Problems complete for non-deterministic PSPACE

4 votes

Is there any context-free language that is inherently ambiguous as an indexed language

4 votes

Where to find info on (polytime) approximability of various discrete optimization problems?

4 votes

Status of certain problems in knot theory

4 votes

Any fundamental papers in TCS which were found to be incorrect/wrong later?

4 votes

NP-complete decision problems on deterministic automata

4 votes

Applications of sunflower lemma in theoretical computer science

4 votes

Minimizing residual finite state automata

3 votes

Protocol partition number and deterministic communication complexity

3 votes

Conjectures implying Four Color Theorem

3 votes

Is feedback vertex set problem is solvable in polynomial time for some special graph