comp.theory

• Thread Index

---

• The Inverse Satisfibility problem
  • From: Denis
• Looking for EXPTIME-algorithm
  • From: filia&sofia
• Re: Efficient (network) algorithm
  • From: Woeginger Gerhard
• Re: all possible subsets of n integers
  • From: wkaras
• Re: data compression program
  • From: stephen
• Re: data compression program
  • From: Einstein
• Re: data compression program
  • From: stephen
• Re: data compression program
  • From: Einstein
• Re: data compression program
  • From: stephen
• Re: data compression program
  • From: stephen
• Re: data compression program
  • From: Einstein
• Re: Efficient (network) algorithm
  • From: ahoyaho
• Re: data compression program
  • From: Barb Knox
• Re: Efficient (network) algorithm
  • From: klaus hoffmann
• Re: data compression program
  • From: Einstein
• Re: data compression program
  • From: stephen
• Re: data compression program
  • From: Einstein
• Re: data compression program
  • From: Barb Knox
• minimizing vertex NFAs
  • From: rpboland
• Re: data compression program
  • From: stephen
• Re: data compression program
  • From: Einstein
• Efficient (network) algorithm
  • From: ahoyaho
• Re: New means to compress random binary data, lossless and repeatable
  • From: Einstein
• 50-th Anniversary of the CORDIC Algorithm
  • From: vladimir
• Re: data compression program
  • From: Barb Knox
• Re: How does memory management work?
  • From: Russell Easterly
• Re: data compression program
  • From: Einstein
• Re: Book about computability, recursive functions and turing machines
  • From: Simba
• Re: Book about computability, recursive functions and turing machines
  • From: tchow
• Re: Book about computability, recursive functions and turing machines
  • From: Casey Hawthorne
• Re: data compression program
  • From: Nicholas King
• Re: data compression program
  • From: Lars Christian Jensen
• Re: Book about computability, recursive functions and turing machines
  • From: Simba
• Re: data compression program
  • From: Tjackson . 1982
• Re: data compression program
  • From: Casey Hawthorne
• Re: data compression program
  • From: Lisa Michelle Smith
• Re: Book about computability, recursive functions and turing machines
  • From: Nathan Gilbert
• Book about computability, recursive functions and turing machines
  • From: Simba
• Re: Finding the Upper Envelope of n Line Segments
  • From: Mitch
• Re: data compression program
  • From: Bryan Olson
• Re: data compression program
  • From: Barb Knox
• Algebraic Geometric Codes
  • From: aarthi28
• Re: data compression program
  • From: Nicholas King
• Re: data compression program
  • From: Lisa Michelle Smith
• Re: data compression program
  • From: Nathan Gilbert
• Re: data compression program
  • From: Tjackson . 1982
• Re: data compression program
  • From: David
• Re: 2SAT, 2DM, and Bin Packing
  • From: klaus hoffmann
• Re: New means to compress random binary data, lossless and repeatable
  • From: wfaxon
• Re: data compression program
  • From: Barb Knox
• data compression program
  • From: Lisa Michelle Smith
• Re: 2SAT, 2DM, and Bin Packing
  • From: Woeginger Gerhard
• 2SAT, 2DM, and Bin Packing
  • From: MARICA.MARIUS@xxxxxxxxx
• Re: all possible subsets of n integers
  • From: Paul E. Black
• all possible subsets of n integers
  • From: Jessica Weiner
• Re: Finding the Upper Envelope of n Line Segments
  • From: Barb Knox
• Finding the Upper Envelope of n Line Segments
  • From: Jessica Weiner
• Its good information to houses,cars
  • From: im4u143
• Re: Sample graphs for testing subgraph-isomorphism algorithm
  • From: Jens Auer
• Re: search then iterate in a sorted container
  • From: blaagraa
• Re: search then iterate in a sorted container
  • From: Ben Pfaff
• search then iterate in a sorted container
  • From: blaagraa
• Re: Nondeterministic turing machines.
  • From: Alex Vinokur
• Re: Conversion binary<->decimal faster than O(n^2)
  • From: Ben Rudiak-Gould
• Re: Matrix multiplication
  • From: Jym
• Matrix multiplication
  • From: Jessica Weiner
• Re: Nondeterministic turing machines.
  • From: r.e.s.
• Re: Nondeterministic turing machines.
  • From: Mitch
• Re: Nondeterministic turing machines.
  • From: Geevarghese Philip
• Sample graphs for testing subgraph-isomorphism algorithm
  • From: J.K. Raju
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: WU Chehai
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: David
• Re: New means to compress random binary data, lossless and repeatable
  • From: Einstein
• Deadline extended: IWPEC 2006
  • From: Hans Bodlaender
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: WU Chehai
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: David
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: WU Chehai
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: David
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: WU Chehai
• Nondeterministic turing machines.
  • From: Vinod
• Re: Question about Prim's Algorithm
  • From: lando2
• Re: Conversion binary<->decimal faster than O(n^2)
  • From: lando2
• Re: Have you Assignment for me ?
  • From: lando2
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: subbu
• Re: Have you Assignment for me ?
  • From: Alan Johnson
• Have you Assignment for me ?
  • From: aatish19@xxxxxxxxx
• Conversion binary<->decimal faster than O(n^2)
  • From: pkochanek
• Re: New means to compress random binary data, lossless and repeatable
  • From: sillybanter
• Re: New means to compress random binary data, lossless and repeatable
  • From: Tjackson . 1982
• Re: New means to compress random binary data, lossless and repeatable
  • From: lando2
• Re: New means to compress random binary data, lossless and repeatable
  • From: lando2
• Re: what's mean??(RFID.....)
  • From: lando2
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: WU Chehai
• Slashdot: Wiki to Help Solve Millennium Problems
  • From: yaoziyuan
• Re: A problem related to maximum the number of bit-1 in binary numbers
  • From: Alan Johnson
• A problem related to maximum the number of bit-1 in binary numbers
  • From: WU Chehai
• Re: How to quickly find supersets and subsets?
  • From: lando2
• Re: How does memory management work?
  • From: lando2
• Re: what's mean RFID & Ubiquitous?
  • From: Matt Timmermans
• Tutte Polynomial block
  • From: Little
• Average case analysis.
  • From: Victor
• How does memory management work?
  • From: chrispatton
• How to quickly find supersets and subsets?
  • From: Lash Rambo
• Question about Prim's Algorithm
  • From: s057077@xxxxxxxxxxxxxxxxxxxx
• Re: N -ROOM LIGHTS PROBLEM
  • From: klaus hoffmann
• Re: what is this problem
  • From: Harris
• Re: New means to compress random binary data, lossless and repeatable
  • From: Harris
• Re: Program transformation?
  • From: tmp123
• Re: what's mean RFID & Ubiquitous?
  • From: Jón Fairbairn
• Re: Program transformation?
  • From: Jamie Andrews; real address @ bottom of message
• what's mean RFID & Ubiquitous?
  • From: Mr Hwang
• Re: New means to compress random binary data, lossless and repeatable
  • From: Einstein
• Re: New means to compress random binary data, lossless and repeatable
  • From: Einstein
• Re: New means to compress random binary data, lossless and repeatable
  • From: Einstein
• Rolling Grid Filling
  • From: techbiz
• what is this problem
  • From: Shaddin Doghmi
• Re: what's mean??(RFID.....)
  • From: AL .
• Re: Is P=?NP pi-0-1
  • From: tchow
• Is P=?NP pi-0-1
  • From: Patrick
• Re: Greedy Algorithm
  • From: jason_box
• Re: Greedy Algorithm
  • From: Googmeister
• Re: Greedy Algorithm
  • From: Googmeister
• Re: Greedy Algorithm
  • From: Woeginger Gerhard
• Re: New means to compress random binary data, lossless and repeatable
  • From: Jordan T. Greenberg
• Re: Greedy Algorithm
  • From: Mitch
• Re: Greedy Algorithm
  • From: Googmeister
• Re: Greedy Algorithm
  • From: Jym
• Greedy Algorithm
  • From: jason_box
• Re: New means to compress random binary data, lossless and repeatable
  • From: sillybanter
• Re: The Feinstein meta-problem
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: New means to compress random binary data, lossless and repeatable
  • From: Randolpho
• The Feinstein meta-problem
  • From: Jamie Andrews; real address @ bottom of message
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Woeginger Gerhard
• Re: New means to compress random binary data, lossless and repeatable
  • From: David Kinny
• Re: New means to compress random binary data, lossless and repeatable
  • From: Ben Pfaff
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: greedy algorithm only works on matroid ?
  • From: Shaddin Doghmi
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: New means to compress random binary data, lossless and repeatable
  • From: Einstein
• Re: New means to compress random binary data, lossless and repeatable
  • From: Arne Ehrlich
• Re: N -ROOM LIGHTS PROBLEM
  • From: ALIABBAS J PETIWALA
• Re: New means to compress random binary data, lossless and repeatable
  • From: RobertSzefler
• New means to compress random binary data, lossless and repeatable
  • From: Einstein
• Re: greedy algorithm only works on matroid ?
  • From: grocery_stocker
• Chromatic Polynomial
  • From: Little
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Map Coloring
  • From: albert_reade
• Re: N -ROOM LIGHTS PROBLEM
  • From: klaus hoffmann
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: greedy algorithm only works on matroid ?
  • From: Hans
• greedy algorithm only works on matroid ?
  • From: halgorithmik
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Woeginger Gerhard
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Save 25%-75% of laborcost on web designing!!!
  • From: boyet59@xxxxxxxxx
• "Local" PHP/MySQL Programmer (I'm cheap and good)
  • From: boyet59@xxxxxxxxx
• Need Freelance Graphic Designer??? I'm cheap and good!
  • From: boyet59@xxxxxxxxx
• Affordable Graphic Design
  • From: boyet59@xxxxxxxxx
• Need to restore your photo??? We have solution for you!
  • From: boyet59@xxxxxxxxx
• Full-Service Digital Media Agency
  • From: boyet59@xxxxxxxxx
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Bryan Olson
• Re: N -ROOM LIGHTS PROBLEM
  • From: Kent Paul Dolan
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• If you post papers purporting to be proofs and don't expect to be challenged on the "proof" ...
  • From: Casey Hawthorne
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Bryan Olson
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Second call for papers: Information-MFCSIT'06
  • From: Damien Woods
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Craig Feinstein
• Reading for amortized analysis
  • From: Daniel M .
• Final Call for Papers: IAENG International Workshop on Computer Science (in IMECS 2006)
  • From: imecs_2006
• Re: Map Coloring
  • From: ccghzhu
• Map Coloring
  • From: albert_reade
• N -ROOM LIGHTS PROBLEM
  • From: ALIABBAS J PETIWALA
• Re: Complexity Theory for Simpletons (Collatz)
  • From: Bryan Olson
• Re: Complexity Theory for Simpletons (Collatz)
  • From: tchow

• Security
• UNIX
• Linux
• Coding
• Usenet

• Archive
• About
• Privacy
• Search
• Imprint

coding.derkeiler.com  > Archive  > General  > comp.theory  > 2006-04