comp.theory
By Subject
236 messages sorted by: [ author ] [ date ] [ thread ]
Starting: 09/30/04
Ending: 10/30/04
- (N)Linspace
- **theory-edge** mailing list
- [OT]: Another claim for P=NP
- [OT]: Another claim for P=NP & Brother EZzz is watching U!
- A Note on Boolean Satisfiability.
- Another claim for P=NP
- Another claim for P=NP & Selmer's humor
- Another set with cardinality |Z|
- Any NP optimization problems that don't reduce to decision problems?
- AVL to Red-Black Tree
- Call for Papers, Data Compression Conference 2005, March 29-31, Snowbird, UT
- Can Human Level A.I. be implemented?
- CATS'05 Accepted Papers
- CFP: LICS 2005 - 12th IEEE Symposium on Logic In Computer Science
- cnf/dnf approximation
- complexity of computing polynomials proof
- complexity of matrix operations
- Complexity question regarding randomized approximation algorithm
- Different size infinities?
- examples of EXPTIME
- FACS FACTS Newsletter Call for Contributions on Formal Aspects of Computing Science (deadline 15 October 2004)
- Fibonacci connection between Huffman codes and Wythoff array
- generating random phrases with semantics.
- Graph theory nomenclature
- help: probability of dropping k items into N buckets
- HIS 2004 final call for papers
- Is this proof right?
- Large scale sorting
- Largest provable BB(N)?
- limit speed of computation - Digital vs. Quantum
- Multiple errors recognition
- Nevermind & sorry for the stuttering
- New book: Stochastic Local Search --- Foundations and Applications
- Olcott is cured of CrackPottery! (Halting Problem)
- On the undecidability of L_d
- P vs NP craziness
- P vs NP craziness & Diaby was already refuted... in 1988
- P vs NP craziness & Oracle's Predictions
- Performance of matching algorithms in practice
- Prefix Averages Problem
- Primitive recursive vs recursive at the base of the arithmetical hierarchy.
- Problem creating a regular expression.
- proof by contradiction
- Proof of inherent ambiguity?
- Proof of lower bound for sorting shoes.
- Proof that this assertion about heaps is true
- Proving a regular language to be infinite
- pumping lemma (second try)
- pumping lemma (third try)
- random number generation & predictability
- RTSS 2004 Call for Participation (Note: Hotel Deadline Oct. 29)
- Semantics of LTS
- Special Case of Sat
- Sum of n numbers 0..1
- Testing for acceptance of Kleene closure of alphabet
- tree generation
- Turing Machine to Train Sets Converter
- Turing Machine with faults, failures and recovery
- Wanted: Nondeterministic Turing Machine of Polynomial Time Complexity
- weighted tree generation
- Zenkin's paper on Cantor
- Zenkin's paper on Cantor (reply of Dr. Zenkin)
Last message date: 10/30/04
Archived on: 10/31/04 CET
236 messages sorted by: [ author ] [ date ] [ thread ]