comp.theory

• Thread Index

---

• Re: Tree search
  • From: berndlosert
• Tree search
  • From: kingpin
• Re: How to compute "A1 x. .. x An subset B" fast if B is fixed?
  • From: anvera
• Re: How to compute "A1 x. .. x An subset B" fast if B is fixed?
  • From: David Wagner
• How to compute "A1 x. .. x An subset B" fast if B is fixed?
  • From: sasha mal
• Re: optimal way in graph?
  • From: berndlosert
• Re: Shortest path with intermediate nodes algorithm
  • From: acamposr
• Re: Shortest path with intermediate nodes algorithm
  • From: Patricia Shanahan
• Re: Shortest path with intermediate nodes algorithm
  • From: acamposr
• Re: A graph theory terminology challenge
  • From: TP2006
• Re: Shortest path with intermediate nodes algorithm
  • From: Luis Quesada
• Re: A graph theory terminology challenge
  • From: Babua
• Re: A graph theory terminology challenge
  • From: TP2006
• A graph theory terminology challenge
  • From: TP2006
• Re: Question about the relationship between the eigenvalues of graph and its subgraph
  • From: Joe.ntang@xxxxxxxxx
• Re: basic query regarding NP Complete...
  • From: tchow
• Re: basic query regarding NP Complete...
  • From: Markus Triska
• Re: Shortest path with intermediate nodes algorithm
  • From: acamposr
• Re: basic query regarding NP Complete...
  • From: Russell Easterly
• Re: basic query regarding NP Complete...
  • From: Prakash
• Re: Shortest path with intermediate nodes algorithm
  • From: Patricia Shanahan
• Re: Shortest path with intermediate nodes algorithm
  • From: acamposr
• Re: Shortest path with intermediate nodes algorithm
  • From: Patricia Shanahan
• Mathematician (consultant/contractor)
  • From: jmcgowan
• Re: Shortest path with intermediate nodes algorithm
  • From: A . L .
• Shortest path with intermediate nodes algorithm
  • From: acamposr
• optimal way in graph?
  • From: CC . TUDresden
• Question about the relationship between the eigenvalues of graph and its subgraph
  • From: Joe . ntang
• Re: Noob question on complexity of emulated machines?
  • From: D. C.
• Re: Noob question on complexity of emulated machines?
  • From: tchow
• Re: basic query regarding NP Complete...
  • From: Russell Easterly
• Re: Find Similar Vertices in a graph
  • From: berndlosert
• Find Similar Vertices in a graph
  • From: Navin
• Noob question on complexity of emulated machines?
  • From: D. C.
• Re: Diopantine Equations and comp science
  • From: Sid Touati
• Re: basic query regarding NP Complete...
  • From: Simon
• Re: basic query regarding NP Complete...
  • From: Russell Easterly
• Re: Diopantine Equations and comp science
  • From: Nathan Gilbert
• Re: SQL query plan question
  • From: Stephan Schulz
• Turing completeness, and generation of non-Turing complete code to solve problems that would typically require Turing complete languages
  • From: pantagruel
• Re: basic query regarding NP Complete...
  • From: Simon
• Re: basic query regarding NP Complete...
  • From: Simon
• Re: basic query regarding NP Complete...
  • From: Russell Easterly
• Re: Graph theory problem
  • From: Barb Knox
• Re: Graph theory problem
  • From: Falk Hueffner
• Graph theory problem
  • From: Rij
• Re: basic query regarding NP Complete...
  • From: Prakash
• Re: basic query regarding NP Complete...
  • From: Kai Schories
• basic query regarding NP Complete...
  • From: Prakash
• averaging technique
  • From: kkrish
• Arranging Rectangles in Smallest Area
  • From: Herbert Glarner
• Re: Is it essential to learn data structures before automata theory?
  • From: sillybanter
• Re: Is it essential to learn data structures before automata theory?
  • From: Barb Knox
• Re: Is it essential to learn data structures before automata theory?
  • From: sillybanter
• HOTI 14 registration deadline extended until August 17, 2006
  • From: lucavc
• recent bib file for algorithms
  • From: soft-group
• Re: Is it essential to learn data structures before automata theory?
  • From: Barb Knox
• Re: An easy one!
  • From: tchow
• Network Flow Inequalities
  • From: berndlosert
• Re: An easy one!
  • From: raygoza4@xxxxxxxxx
• An easy one!
  • From: D. C.
• Diopantine Equations and comp science
  • From: Fernando Rodríguez
• Re: Is it essential to learn data structures before automata theory?
  • From: examachine
• Is it essential to learn data structures before automata theory?
  • From: Student Body
• Re: Subsets from a set
  • From: Torben Ægidius Mogensen
• Re: Subsets from a set
  • From: Torben Ægidius Mogensen
• Re: Interesting problem: automatic item categorization
  • From: yaoziyuan
• Re: Interesting problem: automatic item categorization
  • From: yaoziyuan
• Re: Interesting problem: automatic item categorization
  • From: yaoziyuan
• Interesting problem: automatic item categorization
  • From: yaoziyuan
• Dynamic Fractional Cascading
  • From: spolu
• Dynamic Fractional Cascading
  • From: spolu
• Make money by doing nothing!
  • From: lukkyloopz
• HOTI 14: 2 weeks remaining for registering
  • From: lucavc
• Re: Adding practical (runtime) facts to a program
  • From: yaoziyuan
• Re: What complexity class is 6 Degrees of Kevin Bacon?
  • From: A . L .
• Re: What complexity class is 6 Degrees of Kevin Bacon?
  • From: D. C.
• Re: What complexity class is 6 Degrees of Kevin Bacon?
  • From: D. C.
• Re: What complexity class is 6 Degrees of Kevin Bacon?
  • From: Ralph Hartley
• Re: What complexity class is 6 Degrees of Kevin Bacon?
  • From: Googmeister
• Re: What complexity class is 6 Degrees of Kevin Bacon?
  • From: D. C.
• Re: What complexity class is 6 Degrees of Kevin Bacon?
  • From: tchow
• What complexity class is 6 Degrees of Kevin Bacon?
  • From: D. C.
• Re: Adding practical (runtime) facts to a program
  • From: A . L .
• Re: Adding practical (runtime) facts to a program
  • From: yaoziyuan
• i=infinity;0= i*sin k*pi, 1=cos k*pi, k=m/n, n=4,m=0-00; c*G=20=const, 1/sgrt2>G>0.5, 6<N = NA ^2surf/NAvol<7 ; h/N =11=const, e+i*pi; D universe =f(h)*1/ (a))^4, T=f( m, S, D)
  • From: ivars . fabriciuss
• vector union minimal DNF -> minimal DNF
  • From: sasha mal
• Re: List of hard Problems with Transitions from underconstrained to overconstrained
  • From: ogucuk@xxxxxxxxx
• Re: Subsets from a set
  • From: stdazi@xxxxxxxxx
• The reachability problem of Petri net with priority is undecidable!
  • From: calender2002
• Adding practical (runtime) facts to a program
  • From: yaoziyuan
• Re: Definition of Empty Graph
  • From: Le Chaud Lapin
• Re: Subsets from a set
  • From: Paul E. Black
• Re: Definition of Empty Graph
  • From: Paul E. Black
• Re: Subsets from a set
  • From: stush
• Re: Definition of Empty Graph
  • From: Dr A. N. Walker
• Re: Subsets from a set
  • From: stdazi@xxxxxxxxx
• Re: Subsets from a set
  • From: stush
• Subsets from a set
  • From: stdazi@xxxxxxxxx
• Re: Definition of Empty Graph
  • From: Le Chaud Lapin
• Re: Definition of Empty Graph
  • From: Paul E. Black
• Re: Manuscript of dissertation which may be of interest
  • From: stush
• Re: finding k shortest paths
  • From: Steffen
• Re: Definition of Empty Graph
  • From: Le Chaud Lapin
• Re: Definition of Empty Graph
  • From: Casey Hawthorne
• Re: Definition of Empty Graph
  • From: Le Chaud Lapin
• HOTI 14 Call for Participation
  • From: lucavc
• Re: Asking gurus on a CCS sparse matrix initialization question
  • From: AstroBoy
• Re: Definition of Empty Graph
  • From: Paul E. Black
• DOMINANCE relation in game theory...
  • From: shiva
• Definition of Empty Graph
  • From: Le Chaud Lapin
• Help on a graph theory paper...
  • From: matt . zellman
• New Artificial Intelligence, Data Mining, Neural Networks Website
  • From: jaxx81
• finding k shortest paths
  • From: Steffen
• A*, tree, heuristics...
  • From: kingpin
• Re: Regarding quoted-printable encoding
  • From: Chris
• Regarding quoted-printable encoding
  • From: sam_cit
• Re: Text categorization: what are leave-one-out and training errors?
  • From: Simba
• Re: Text categorization: what are leave-one-out and training errors?
  • From: koara
• Re: Asking gurus on a CCS sparse matrix initialization question
  • From: AstroBoy
• Re: Asking gurus on a CCS sparse matrix initialization question
  • From: Dan Hirschberg
• Asking gurus on a CCS sparse matrix initialization question
  • From: AstroBoy
• Re: Algorithm for searching across vectors
  • From: Paul E. Black
• Text categorization: what are leave-one-out and training errors?
  • From: Simba
• Re: Algorithm for searching across vectors
  • From: krisp
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski
• Re: Algorithm for searching across vectors
  • From: Paul E. Black
• Literature about self-managing systems
  • From: Marco Bakera
• Algorithm for searching across vectors
  • From: krisp
• Re: nfa containment problem is pspace-complete,,,,
  • From: Hermann
• Re: Complexity of Sparse Cholesky Factorization
  • From: klaus hoffmann
• Re: salesman problem is in P?
  • From: kooshiar
• Re: Please help Student ?? Finite Automata
  • From: tac-tics
• Re: salesman problem is in P?
  • From: Paul E. Black
• Re: Game on Graphs
  • From: Craig Feinstein
• Re: Game on Graphs
  • From: r.e.s.
• Re: Game on Graphs
  • From: Craig Feinstein
• Game on Graphs
  • From: onkar
• Re: Reductions in P
  • From: tchow
• salesman problem is in P?
  • From: kooshiar
• Re: Reductions in P
  • From: ahuznot
• Re: Please help Student ?? Finite Automata
  • From: Herbert Glarner
• Please help Student ?? Finite Automata
  • From: onkar
• A Combinatorics/Graph Theory Question
  • From: mathlover
• Re: Reductions in P
  • From: tchow
• Re: easy combinatorial algorithm, or not??
  • From: Ben Bacarisse
• Re: Manuscript of dissertation which may be of interest
  • From: Kurt Van Etten
• Re: Manuscript of dissertation which may be of interest
  • From: Jym
• Re: Reductions in P
  • From: iatsonios
• Re: Manuscript of dissertation which may be of interest
  • From: Jens Auer
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski
• Re: Manuscript of dissertation which may be of interest
  • From: Jens Auer
• Re: Manuscript of dissertation which may be of interest
  • From: Antti Ylikoski

We are proud to have Web Hosting and Rack Housing from 9 Net Avenue Deutschland.
(15)