comp.theory

Thread Index

Re: A hashing problem
- From: Zig
A hashing problem
- From: rpboland
Re: Can anyone explain this quote?
- From: Alan S
Re: Can anyone explain this quote?
- From: examachine
Re: Can anyone explain this quote?
- From: Claudio Grondi
Re: Can anyone explain this quote?
- From: Rick Decker
Re: Can anyone explain this quote?
- From: Ben Rudiak-Gould
Re: Can anyone explain this quote?
- From: Claudio Grondi
Re: a question on regular languages
- From: Jaisingh Solanki
Re: a question on regular languages
- From: Rick Decker
Re: Can anyone explain this quote?
- From: Craig Feinstein
Re: Can anyone explain this quote?
- From: John F
Can anyone explain this quote?
- From: Craig Feinstein
Re: a question on regular languages
- From: venkata subramanian
a question on regular languages
- From: venkata subramanian
Re: Text fingerprinting
- From: Zig
Re: Can someone give me an example of this type of problem?
- From: grouchy
Re: Text fingerprinting
- From: Thad Smith
Re: Can someone give me an example of this type of problem?
- From: grouchy
Text fingerprinting
- From: Sumedh
SPIN 2006 Last call for papers. DL: December 2, 2005
- From: Valmari Antti
Re: Complexity of graph problems
- From: Jaisingh Solanki
Re: Complexity of graph problems
- From: Nathan Gilbert
Re: Proof - the right track?
- From: andy . twigg
Re: "Importance" of a node in a graph
- From: Falk Hueffner
"Importance" of a node in a graph
- From: hbdere
Re: Special matching problem
- From: Michael Hussmann
Re: Special matching problem
- From: Woeginger Gerhard
Re: Special matching problem
- From: Michael Hussmann
Re: Special matching problem
- From: Zig
Special matching problem
- From: Michael Hussmann
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
Re: Can someone give me an example of this type of problem?
- From: tchow
Re: Proof - the right track?
- From: Pat Farrell
Proof - the right track?
- From: RonnyM
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
gre practice booklet (computer science)
- From: titanium . bits
Re: Filling 2d array in less than O(n^2)?
- From: Dimitri Ognibene
Re: Can someone give me an example of this type of problem?
- From: tchow
Re: hash,index, dictionary
- From: Arash Partow
Re: rb-tree creation from sorted sequence
- From: Ben Pfaff
Re: Filling 2d array in less than O(n^2)?
- From: jeffrey_h_miller
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
Re: rb-tree creation from sorted sequence
- From: Googmeister
hash,index, dictionary
- From: ed.thyme
Bag intersections to create trees from bigger bags
- From: Hiren Joshi
rb-tree creation from sorted sequence
- From: Arne Ehrlich
Re: O-notation
- From: Pat Farrell
Re: O-notation
- From: Richard Harter
Re: O-notation
- From: Ronny Mandal
Re: [ counting sort ideea... ]
- From: ed.thyme
Re: [ counting sort ideea... ]
- From: Marcin
[ counting sort ideea... ]
- From: ed.thyme
Re: O-notation
- From: Pat Farrell
Re: "Reverse Doubling List", is there another name?
- From: cdiggins
Re: "Reverse Doubling List", is there another name?
- From: Torben Ægidius Mogensen
O-notation
- From: Ronny Mandal
category theory question
- From: Godfrey Muganda
"Reverse Doubling List", is there another name?
- From: cdiggins
Re: "The Art of Computer Programming" by Knuth
- From: jitasi
Re: Filling 2d array in less than O(n^2)?
- From: Nicholas King
Re: Filling 2d array in less than O(n^2)?
- From: A . L .
Re: Filling 2d array in less than O(n^2)?
- From: Jason Barrett Prado
Re: Filling 2d array in less than O(n^2)?
- From: A . L .
Re: Filling 2d array in less than O(n^2)?
- From: Amitabha Roy
Re: Filling 2d array in less than O(n^2)?
- From: pjhyett
Re: Filling 2d array in less than O(n^2)?
- From: Casey Hawthorne
Filling 2d array in less than O(n^2)?
- From: pjhyett
Re: Can someone give me an example of this type of problem?
- From: Googmeister
Re: Problems with JFLAP
- From: Torben Ægidius Mogensen
Re: Create DFA from regular expression?
- From: Torben Ægidius Mogensen
Problems with JFLAP
- From: Paminu
Re: Create DFA from regular expression?
- From: Paminu
Re: Can someone give me an example of this type of problem?
- From: paragn
Re: Create DFA from regular expression?
- From: Matt Timmermans
Re: Can someone give me an example of this type of problem?
- From: tchow
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
Re: Can someone give me an example of this type of problem?
- From: stephen
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
Re: Can someone give me an example of this type of problem?
- From: stephen
Create DFA from regular expression?
- From: Paminu
Re: "The Art of Computer Programming" by Knuth
- From: Nathan Gilbert
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
Re: Count all the substrings in a string
- From: Aatu Koskensilta
Re: Help about Graphy Theory and Communication Networks plz..
- From: Nicholas King
Re: Count all the substrings in a string
- From: Shail
Re: Count all the substrings in a string
- From: Nathan Gilbert
Re: Can someone give me an example of this type of problem?
- From: tchow
Re: Help about Graphy Theory and Communication Networks plz..
- From: Nathan Gilbert
Re: Can someone give me an example of this type of problem?
- From: Nathan Gilbert
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
Re: Help about Graphy Theory and Communication Networks plz..
- From: Jamie Andrews; real address @ bottom of message
Re: Can someone give me an example of this type of problem?
- From: Googmeister
Re: Can someone give me an example of this type of problem?
- From: jeffrey_h_miller
Re: Count all the substrings in a string
- From: Paul E. Black
Re: Count all the substrings in a string
- From: shailendra . malik
Re: Can anyone please help me with this question
- From: Aaron
Re: Shortest path algorithms
- From: Jaisingh Solanki
Re: Can someone give me an example of this type of problem?
- From: Googmeister
Re: Can someone give me an example of this type of problem?
- From: Nathan Gilbert
Re: Can someone give me an example of this type of problem?
- From: stephen
Re: Can anyone please help me with this question
- From: Rick Decker
Re: Can someone give me an example of this type of problem?
- From: Jym
Re: Can someone give me an example of this type of problem?
- From: Nathan Gilbert
Re: Can someone give me an example of this type of problem?
- From: grouchy
Help about Graphy Theory and Communication Networks plz..
- From: xeyder
Re: Is P=NP? Thought process approach.
- From: Jaisingh Solanki
Re: Can someone give me an example of this type of problem?
- From: stephen
Re: Can someone give me an example of this type of problem?
- From: Nathan Gilbert
Re: Can anyone please help me with this question
- From: stephen
Re: Can anyone please help me with this question
- From: Aaron
Re: Can anyone please help me with this question
- From: Aaron
Re: Shortest path algorithms
- From: wade
Re: Can someone give me an example of this type of problem?
- From: Johan Kwisthout
Can someone give me an example of this type of problem?
- From: Nathan Gilbert
Re: Is P=NP? Thought process approach.
- From: jeffrey_h_miller
Re: Shortest path algorithms
- From: ThemePark
Re: Can anyone please help me with this question
- From: georgie
Re: Shortest path algorithms
- From: stephen
Re: Shortest path algorithms
- From: TheOriginalThemePark
Re: Shortest path algorithms
- From: stephen
Shortest path algorithms
- From: TheOriginalThemePark
Re: Is P=NP? Thought process approach.
- From: Ramasamy C
CSR-2006: Deadline set to December 11
- From: CSR-2006
Re: Can anyone please help me with this question
- From: Pat Farrell
Re: X3SAT Question
- From: Russell Easterly
Re: Can anyone please help me with this question
- From: Barb Knox
Re: Count all the substrings in a string
- From: itportal
Can anyone please help me with this question
- From: Aaron
Re: Count all the substrings in a string
- From: Bryan Olson
Re: Count all the substrings in a string
- From: itportal
Re: Count all the substrings in a string
- From: Bryan Olson
Re: Count all the substrings in a string
- From: itportal
Lee' algorithm for visibility polygon
- From: Nangi
Re: X3SAT Question
- From: RickO
Re: Count all the substrings in a string
- From: Bryan Olson
Re: Count all the substrings in a string
- From: Googmeister
Re: Count all the substrings in a string
- From: itportal
Re: Count all the substrings in a string
- From: Bryan Olson
Count all the substrings in a string
- From: itportal
Re: Log-space Completeness Question
- From: PeterPan
Re: Log-space Completeness Question
- From: tchow
Re: Help with quantum computing project
- From: Paul E. Black
Re: subtree isomorphism problem
- From: Joe . ntang
Re: subtree isomorphism problem
- From: Joe . ntang
Re: subtree isomorphism problem
- From: Matt Timmermans
Help with quantum computing project
- From: kenfitz3
Re: A distributed algorithm to assign multiple colors to a single vertex
- From: iwan2no
Re: A distributed algorithm to assign multiple colors to a single vertex
- From: Jaisingh Solanki
Re: Is P=NP? Thought process approach.
- From: Jaisingh Solanki
A distributed algorithm to assign multiple colors to a single vertex
- From: iwan2no
Re: Log-space Completeness Question
- From: Sam
Re: Log-space Completeness Question
- From: albinali
Re: Is P=NP? Thought process approach.
- From: Ramasamy C
Re: Does random number really exist?
- From: Torben Ægidius Mogensen
Re: Does random number really exist?
- From: Torben Ægidius Mogensen
Re: Log-space Completeness Question
- From: PeterPan
Log-space Completeness Question
- From: Sam
Re: subtree isomorphism problem
- From: Joe . ntang
Re: Context Free Language
- From: Jaisingh Solanki
Re: Is P=NP? Thought process approach.
- From: Jaisingh Solanki
Re: subtree isomorphism problem
- From: Matt Timmermans
subtree isomorphism problem
- From: Joe . ntang
Floor planning algorithms
- From: Arash Partow
Re: Is P=NP? Thought process approach.
- From: Ben Rudiak-Gould
Re: Is P=NP? Thought process approach.
- From: Ramasamy C
Re: Is P=NP? Thought process approach.
- From: Ramasamy C
Re: Is P=NP? Thought process approach.
- From: Sed
Is P=NP? Thought process approach.
- From: Ramasamy C
X3SAT Question
- From: Russell Easterly
Re: Does random number really exist?
- From: examachine
Re: Does random number really exist?
- From: examachine
Re: Does random number really exist?
- From: examachine
Re: Does random number really exist?
- From: examachine
Re: Does random number really exist?
- From: scattered
Re: polygons question
- From: RobertSzefler
Re: polygons question
- From: makc . the . great
Re: polygons question
- From: RobertSzefler
Re: polygons question
- From: makc . the . great
Re: polygons question
- From: makc . the . great
Implementing a graph algebra
- From: Marius Amado Alves
Re: polygons question
- From: makc . the . great
Re: polygons question
- From: RobertSzefler
Re: polygons question
- From: makc . the . great
Re: polygons question
- From: RobertSzefler
polygons question
- From: makc . the . great
i-C&P "Computers + Philosophy" int'l conference -LAST CALL (1000+150 wds.)
- From: Colin . Schmidt
Re: Algorithm to define unrestricted grammar
- From: examachine
Fuzzy CSP
- From: nur
Re: computation in the limit
- From: examachine
computation in the limit
- From: examachine
Re: Algorithm to define unrestricted grammar
- From: Niek Sombekke
CSR-2006: Call For Papers
- From: CSR-2006
Re: Complexity Question
- From: crasmarum
Re: Complexity Question
- From: nur
Re: Complexity Question
- From: crasmarum
Re: Performance issues between different binary trees
- From: Ben Pfaff
Re: Performance issues between different binary trees
- From: Ben Pfaff
Complexity Question
- From: nur
Re: Performance issues between different binary trees
- From: stephen
Re: Performance issues between different binary trees
- From: Googmeister
Re: Performance issues between different binary trees
- From: Ben Pfaff
Re: Performance issues between different binary trees
- From: stephen
Re: Performance issues between different binary trees
- From: Ben Pfaff
Re: Performance issues between different binary trees
- From: Bryan Olson
Re: interactive "smarts"
- From: makc . the . great
Re: Does random number really exist?
- From: Jean-Yves Moyen
Re: Does random number really exist?
- From: Poldie
Re: collapsing a tree into a list
- From: tunesmith
Re: Performance issues between different binary trees
- From: Googmeister
Re: Context Free Language
- From: Gene
Context Free Language
- From: simsim
interactive "smarts"
- From: examachine
Performance issues between different binary trees
- From: Curious
Re: minimum disjoint paths covering of a graph - algorithm needed
- From: Nicholas King
Re: minimum disjoint paths covering of a graph - algorithm needed
- From: Marcin
Re: collapsing a tree into a list
- From: tunesmith
Re: collapsing a tree into a list
- From: Rick Decker
Re: collapsing a tree into a list
- From: Espen Suenson
collapsing a tree into a list
- From: tunesmith
Postdoc Position Univ. of Oxford - Dept. of Statistics
- From: rocco@xxxxxxxxxxxxxx
Re: minimum disjoint paths covering of a graph - algorithm needed
- From: John Gabbriel
Re: minimum disjoint paths covering of a graph - algorithm needed
- From: Marcin
Re: minimum disjoint paths covering of a graph - algorithm needed
- From: A . L .
Re: minimum disjoint paths covering of a graph - algorithm needed
- From: John Gabbriel
Re: minimum disjoint paths covering of a graph - algorithm needed
- From: Marcin