The following pages link to Georg Schnitger (Q436320):
Displaying 50 items.
- (Q235166) (redirect page) (← links)
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Fast equality test for straight-line compressed strings (Q436321) (← links)
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Ambiguity and communication (Q537915) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines (Q808247) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- Lower bounds on communication complexity (Q1097691) (← links)
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- A family of graphs with expensive depth-reduction (Q1164427) (← links)
- On the power of white pebbles (Q1180416) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- The communication complexity of several problems in matrix computation (Q1186508) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- A comparison of two lower-bound methods for communication complexity (Q1350995) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
- Rounds versus time for the two person pebble game (Q2641235) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- (Q2754144) (← links)
- (Q2762506) (← links)
- On the Greedy Superstring Conjecture (Q3440268) (← links)
- On the Performance of the Minimum Degree Ordering for Gaussian Elimination (Q3482751) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- (Q3751009) (← links)
- (Q3751010) (← links)
- (Q3907090) (← links)
- The Probabilistic Communication Complexity of Set Intersection (Q4030193) (← links)
- (Q4228510) (← links)
- (Q4312661) (← links)
- Nondeterministic Communication with a Limited Number of Advice Bits (Q4441900) (← links)
- (Q4449165) (← links)
- (Q4449194) (← links)
- (Q4699286) (← links)
- (Q4718233) (← links)
- (Q4737913) (← links)
- (Q4746797) (← links)
- (Q4792910) (← links)
- Communication complexity of matrix computation over finite fields (Q4835864) (← links)
- (Q4839054) (← links)
- (Q4938639) (← links)
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164) (← links)
- On the complexity of approximating the independent set problem (Q5096160) (← links)
