comp.theory

Date Index

log and Big-omega & Big-O?, someone_259
- Re: log and Big-omega & Big-O?, Geevarghese Philip
Friend-machines-assisted approach to downloading via BitTorrent, yaoziyuan
Reduction, Peng Wang
- Re: Reduction, tchow
  - Re: Reduction, tchow
To find if two sets are disjoint or not, ajay
- Re: To find if two sets are disjoint or not, Hei Makaroni
  - Re: To find if two sets are disjoint or not, Hei Makaroni
- Re: To find if two sets are disjoint or not, Torben Ægidius Mogensen
Space-Efficient Representation for Construction of Very Large Graphs?, chessaurus
- Re: Space-Efficient Representation for Construction of Very Large Graphs?, mike . angstadt
- Re: Space-Efficient Representation for Construction of Very Large Graphs?, hbdere
- Re: Space-Efficient Representation for Construction of Very Large Graphs?, Le Chaud Lapin
- Re: Space-Efficient Representation for Construction of Very Large Graphs?, Jean-Marc Bourguet
  - Re: Space-Efficient Representation for Construction of Very Large Graphs?, chessaurus
Conjecture about Complexity of a Quantum Computation Algorithm, tucci
midterm for 94.404 at UMass Lowell, TheGist
- Re: midterm for 94.404 at UMass Lowell, David Wagner
  - Re: midterm for 94.404 at UMass Lowell, TheGist
    - Re: midterm for 94.404 at UMass Lowell, David Wagner
    - Re: midterm for 94.404 at UMass Lowell, Antti Valmari
    - Re: midterm for 94.404 at UMass Lowell, David Wagner
    - Re: midterm for 94.404 at UMass Lowell, Antti Valmari
    - Re: midterm for 94.404 at UMass Lowell, David Wagner
    - Re: midterm for 94.404 at UMass Lowell, Nicholas King
    - Re: midterm for 94.404 at UMass Lowell, Antti Valmari
    - Re: midterm for 94.404 at UMass Lowell, David Wagner
Re: anyone knows something about algorithm designer?, makc . the . great
CFPart: DEON 2006, Eighth International Workshop on Deontic Logic, Jan Broersen
Position: Full Professorship in Algorithms and Data Structures, Uffe Henrik Engberg
HOTI 14 Call for Tutorials, lucavc
Set cover turn to ILP ?, Rhyspace@xxxxxxxxx
Hungarian method - bipartite matching, johanditmar@xxxxxxxxx
Hola, queres jugar?, martinnapole
Complexity Conferences Ranking, kooshiar
- <Possible follow-ups>
- Complexity Conferences Ranking, kooshiar
regular expressions and DFAs, sylvain . gaudan
- Re: regular expressions and DFAs, Alan Johnson
Telling if two linear discriminants are the same, yaroslavvb
2D array alignment, Zoh Huan Queue
NP-hardness of multicriteria single machine scheduling, grekenator
Solutions to Sipsers Exercises, snehit . prabhu
- Re: Solutions to Sipsers Exercises, Rick Decker
  - Re: Solutions to Sipsers Exercises, snehit.prabhu@xxxxxxxxx
    - Re: Solutions to Sipsers Exercises, snehit.prabhu@xxxxxxxxx
Branching Programs, blakman211
about NP-completeness, grekenator
- Re: about NP-completeness, Hei Makaroni
  - Re: about NP-completeness, grekenator
    - Re: about NP-completeness, Hei Makaroni
    - Re: about NP-completeness, grekenator
    - Re: about NP-completeness, stephen
- Re: about NP-completeness, Hei Makaroni
union of language homomorphisms, John Balanced
- Re: union of language homomorphisms, sasha mal
Is Big Bang a big bug?, .
Re: test, Robby Goetschalckx
Question on TM, PDA and FA., Charan
- Re: Question on TM, PDA and FA., Nicholas King
- Re: Question on TM, PDA and FA., Mitch
Computable Categories and Primitive Recursive Arithmetic, RexButler
Any algorithm with superpolynomial subexponential runtime?, sasha mal
- Re: Any algorithm with superpolynomial subexponential runtime?, David Wagner
- Re: Any algorithm with superpolynomial subexponential runtime?, RobertSzefler
- <Possible follow-ups>
- Any algorithm with superpolynomial subexponential runtime?, sasha mal
  - Re: Any algorithm with superpolynomial subexponential runtime?, Googmeister
  - Re: Any algorithm with superpolynomial subexponential runtime?, sasha mal
Context representation, models and modelling, Alexander Lofin
Re: Algorithms for finding weak patterns in a data stream, jjan
Finite Automata and couple of questions on Theory of Comp. Science.., Charan
- Re: Finite Automata and couple of questions on Theory of Comp. Science.., Nicholas King
  - Re: Finite Automata and couple of questions on Theory of Comp. Science.., Charan
    - Re: Finite Automata and couple of questions on Theory of Comp. Science.., Harri Haanpaa
- Re: Finite Automata and couple of questions on Theory of Comp. Science.., Geevarghese Philip
  - Re: Finite Automata and couple of questions on Theory of Comp. Science.., Charan
Variations on Cyclic Tag, r.e.s.
- Re: Variations on Cyclic Tag, r.e.s.
Re: Iteration vs. Recursion, Julian V. Noble
- Re: Iteration vs. Recursion, Torben Ægidius Mogensen
- <Possible follow-ups>
- Re: Iteration vs. Recursion, Julian V. Noble
- Re: Iteration vs. Recursion, Julian V. Noble
  - Re: Iteration vs. Recursion, Torben Ægidius Mogensen
- Re: Iteration vs. Recursion, David Lightstone
  - Re: Iteration vs. Recursion, Torben Ægidius Mogensen
- Re: Iteration vs. Recursion, Marshall
- Re: Iteration vs. Recursion, Ben Pfaff
graph algorithm needed, markus . kohler
- Re: graph algorithm needed, ccghzhu
- Re: graph algorithm needed, Nicholas King
  - Re: graph algorithm needed, klaus hoffmann
Typing: A real example of a one-way-function, Craig Feinstein
computability theory, collichucks
- Re: computability theory, Mitch
"Collatz is unprovable" revisited, Craig Feinstein
- Re: "Collatz is unprovable" revisited, Bryan Olson
Re: 50-th Anniversary of the CORDIC Algorithm, vladimir
geometry algorithm, laura