Computer theory And NotBernhard Steffen
List of bibliographic references
Number of relevant bibliographic references: 17.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000229 | Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne] | Nondeterministic Instance Complexity and Hard-to-Prove Tautologies |
| 000236 | Anna Bernasconi [Allemagne] ; Carsten Damm [Allemagne] ; Igor E. Shparlinski [Australie] | On the Average Sensitivity of Testing Square-Free Numbers |
| 000237 | Helmut Seidl [Allemagne] ; Andreas Neumann [Allemagne] | On Guarding Nested Fixpoints |
| 000238 | Carsten Damm [Allemagne] ; Ki Hang Kim [États-Unis] ; Fred Roush [États-Unis] | On Covering and Rank Problems for Boolean Matrices and Their Applications |
| 000247 | Anna Slobodová [Allemagne] | On the composition problem for OBDDs with multiple variable orders |
| 000248 | Stasys Jukna [Allemagne, Lituanie] ; Stanislav Žák [République tchèque] | On branching programs with bounded uncertainty |
| 000249 | Carsten Damm [Allemagne] | On Boolean vs. Modular arithmetic for circuits and communication protocols |
| 000251 | Andreas Neumann [Allemagne] ; Helmut Seidl [Allemagne] | Locating Matches of Tree Patterns in Forests |
| 000254 | M. Mundhenk [Allemagne] ; A. Slobodova [Allemagne] | Optimal non-approximability of MAXCLIQUE |
| 000255 | Klaus Jansen [Allemagne] | The optimum cost chromatic partition problem |
| 000257 | Martin Mundhenk [Allemagne] ; Judy Goldsmith [États-Unis] ; Eric Allender [États-Unis] | The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes |
| 000258 | Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne] | On the influence of the state encoding on OBDD-representations of finite state machines |
| 000259 | S. Jukna [Allemagne] ; A. Razborov [Russie, Cuba] ; P. Savick [République tchèque, Swaziland] ; I. Wegener [Allemagne] | On P versus NP∩co-NP for decision trees and read-once branching programs |
| 000261 | Martin Mundhenk [Allemagne] | NP-hard sets have many hard instances |
| 000262 | Christos Kaklamanis [Grèce] ; Pino Persiano [Italie] ; Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne] | Constrained bipartite edge coloring with applications to wavelength routing |
| 000264 | Klaus Jansen [Allemagne] | Approximation results for the optimum cost chromatic partition problem |
| 000268 | Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne] | A new approximation algorithm for the register allocation problem |
| This area was generated with Dilib version V0.6.31. |  |