comp.theory
- Calculate number of (binary) inversions
- From: Pete Staab
- Re: Is there a better way to simulate randomly choosing from a weighted set?
- From: A.G.McDowell
- Re: Is there a better way to simulate randomly choosing from a weighted set?
- From: Ben Bacarisse
- Re: Is there a better way to simulate randomly choosing from a weighted set?
- From: Russell Easterly
- Re: Is there a better way to simulate randomly choosing from a weighted set?
- From: Googmeister
- Is there a better way to simulate randomly choosing from a weighted set?
- From: yay_frogs
- Re: pda for a language
- From: Aaron Lint
- Re: Big Oh
- From: Aaron Lint
- Re: pda for a language
- From: Aaron Lint
- pda for a language
- From: kool_guy
- Re: HEAP SORT
- From: al pacino
- checking randomness
- From: al pacino
- Re: Big Oh
- From: Nicholas King
- Big Oh
- From: Jessica Weiner
- Re: HEAP SORT
- From: Ben Bacarisse
- Re: HEAP SORT
- From: Radha
- Re: HEAP SORT
- From: Ben Bacarisse
- Re: HEAP SORT
- From: iBBiS
- Re: revision algorithms
- From: Andrae Muys
- Re: o-1 Knapsack problem
- From: Radha
- HEAP SORT
- From: Radha
- Re: revision algorithms
- From: cartoper
- Re: revision algorithms
- From: Ben Pfaff
- Re: CFG for L(G) and L(G')
- From: jason_box
- Re: revision algorithms
- From: Paul E. Black
- revision algorithms
- From: cartoper
- Re: CFG for L(G) and L(G')
- From: Torben Ægidius Mogensen
- Re: o-1 Knapsack problem
- From: Andrey Goder
- Re: permutation of L
- From: Gene
- Call for Papers: IAENG International Workshop on Operations Research (of IMECS 2006)
- From: imecs2006
- CFG for L(G) and L(G')
- From: jason_box
- Any randomized algorithm for solving the 2-D bin-packing problem?
- From: jing . ai
- Re: cfg for this language
- From: kool_guy
- Re: cfg for this language
- From: kool_guy
- Re: context-free grammars (cfg) for the language
- From: kool_guy
- Re: context-free grammars (cfg) for the language
- From: kool_guy
- Re: cfg for this language
- From: lintile
- Re: context-free grammars (cfg) for the language
- From: Barb Knox
- Re: cfg for this language
- From: Heiner Marxen
- permutation of L
- From: kool_guy
- cfg for this language
- From: kool_guy
- context-free grammars (cfg) for the language
- From: kool_guy
- Solving X3SAT Using Bipartite Graphs
- From: Russell Easterly
- o-1 Knapsack problem
- From: Radha
- Graph Theory and Combinatorics Forum
- From: saad
- Call for Papers: IMECS 2006 (the multiconference of 14 engineering & computer science conferences)
- From: imecs__2006
- Re: Books on Computer Theory
- From: physicsboy
- Re: Books on Computer Theory
- From: Nathan Gilbert
- Graph theory proof problem
- From: Vinay
- CFP:Workshop on Nature Inspired Cooperative Strategies for Optimization NICSO 2006
- From: dpelta
- Re: Books on Computer Theory
- From: Samuel Hornus
- Re: Books on Computer Theory
- From: Googmeister
- Re: Books on Computer Theory
- From: physicsboy
- Re: Books on Computer Theory
- From: Samuel Hornus
- Books on Computer Theory
- From: physicsboy
- Re: Ambuguity of CFG
- From: beelzebub
- Re: languages
- From: beelzebub
- Minimal elements of a poset
- From: Jens Auer
- Re: languages
- From: Torben Ægidius Mogensen
- Re: Ambuguity of CFG
- From: Torben Ægidius Mogensen
- Re: Ambuguity of CFG
- From: J.Jongejan
- Re: Ambuguity of CFG
- From: J.Jongejan
- Re: help proving decidability of a set
- From: Gene
- Re: languages
- From: jason_box
- probability of where a random element goes when inserted into an already sorted list?
- From: jani
- Re: help proving decidability of a set
- From: Per Freem
- Re: Large-scale full-text search: how to get the intersection list fast?
- From: yaoziyuan
- Large-scale full-text search: how to get the intersection list fast?
- From: yaoziyuan
- Make $$Thousands$$ using PayPal and $6
- From: patsfanct23
- Re: closed form for T(n) = c^n + T(n-1)
- From: beelzebub
- Re: Ambuguity of CFG
- From: stylez
- Re: languages
- From: jason_box
- Re: languages
- From: beelzebub
- Re: Ambuguity of CFG
- From: beelzebub
- Re: languages
- From: jason_box
- Re: languages
- From: beelzebub
- Re: Ambuguity of CFG
- From: jason_box
- Re: languages
- From: jason_box
- Re: Ambuguity of CFG
- From: J.Jongejan
- Re: Ambuguity of CFG
- From: Rick Decker
- Re: languages
- From: Barb Knox
- Re: languages
- From: Torben Ægidius Mogensen
- Re: languages
- From: jason_box
- Re: languages
- From: jason_box
- Re: languages
- From: Barb Knox
- Re: X3SAT Question
- From: Russell Easterly
- languages
- From: jason_box
- Ambuguity of CFG
- From: stylez
- Re: closed form for T(n) = c^n + T(n-1)
- From: Daniel Cer
- Re: help proving decidability of a set
- From: Gene
- help proving decidability of a set
- From: Per Freem
- Re: The Wikipedia Article On Turing Machines vs. Physical Devices
- From: examachine
- Re: closed form for T(n) = c^n + T(n-1)
- From: David Kinny
- Re: closed form for T(n) = c^n + T(n-1)
- From: Daniel Cer
- ZFC IS INCONSISTENT
- From: JAYKOV
- closed form for T(n) = c^n + T(n-1)
- From: Daniel Cer
- Re: The Wikipedia Article On Turing Machines vs. Physical Devices
- From: markwh04
- Re: The Wikipedia Article On Turing Machines vs. Physical Devices
- From: examachine
- Re: The Wikipedia Article On Turing Machines vs. Physical Devices
- From: markwh04
- Call for Papers: IMECS 2006 (multiconference of 14 engineering & computer science conferences)
- From: imecs_2006
- Re: RAM-CPU Singularity
- From: Kurt Van Etten
- Re: RAM-CPU Singularity
- From: Karl Klose
- Re: The Wikipedia Article On Turing Machines vs. Physical Devices
- From: examachine
- The Wikipedia Article On Turing Machines vs. Physical Devices
- From: Marissa Kay
- Re: RAM-CPU Singularity
- From: Paul E. Black
- Call for Papers: IAENG International Workshop on Computer Science (in IMECS 2006)
- From: imecs__2006
- Re: RAM-CPU Singularity
- From: rengolin
- Transition System
- From: albert_reade
- Sorting large number of records
- From: technator
- RAM-CPU Singularity
- From: yaoziyuan
- June 26-30, 2006, Summer School on Game Theory in Computer Science
- From: Gerth Stolting Brodal
- Re: algorithms
- From: Dan Hirschberg
- algorithms
- From: Rani
- Re: Search for PhD Thesis: Arthanari, On Some Problems of Sequencing Grouping
- From: Christian Junk
- Question Help
- From: charleshowardmath
- Re: Balanced Search Trees Node using arrays: is that possible?
- From: Ben Pfaff
- Re: Search for PhD Thesis: Arthanari, On Some Problems of Sequencing Grouping
- From: csviks
- Re: [Q]: List of all possible reductions between NP problems
- From: Russell Easterly
- Re: : List of all possible reductions between NP problems
- From: moti_ba
- Re: [Q]: List of all possible reductions between NP problems
- From: Joe Hendrix
- Re: Significance of "Relativizations of the P =? NP Question"
- From: Kurt Van Etten
- re: a graph problem...
- From: chris
- Re: Significance of "Relativizations of the P =? NP Question"
- From: examachine
- LDPC codes and Channel/Source coding
- From: saad
- Re: : List of all possible reductions between NP problems
- From: NPC
- Call for Papers: The 2006 IAENG International Workshop on Operations Research (of IMECS 2006)
- From: imecs__2006
- Re: Significance of "Relativizations of the P =? NP Question"
- From: tchow
- Re: multiple-string matching & regular expressions
- From: Nitin Motgi