comp.theory

Thread Index

Proof of minimal colour in vertex colouring problem
- From: Joojle
LIVE PROJECTS FOR FINAL YEAR STUDENTS FOR B.E(CSE/ISE/ECE)/M.Tech/BCA/MCA/M.SC/B.SC
- From: ravi.malashetty@xxxxxxxxx
Re: Simulation: digital vs analogue
- From: Tim Tyler
LTL vs. CTL
- From: sasha mal
Re: Simulation: digital vs analogue
- From: Paul E. Black
Re: encoding a vector
- From: Harri Haanpaa
Re: Huge database
- From: Denis
encoding a vector
- From: muede73
Workshop "Medical Imaging Systems" within EUROMEDIA 2008 - Last Call for Papers
- From: tavares@xxxxxxxx
Re: Simulation: digital vs analogue
- From: Chris F Clark
MULTICONF-08 Final call for papers
- From: john
Re: Simulation: digital vs analogue
- From: Tim Tyler
Re: Simulation: digital vs analogue
- From: A.G.McDowell
Simulation: digital vs analogue
- From: Tim Tyler
Reversible Logic
- From: Tim Tyler
Re: Huge database
- From: Paul E. Black
COMSOC-2008 Call for papers
- From: paul . w . goldberg
2000 solution manuals, solution manual, Student Study Guide solutions
- From: sms123
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Huge database
- From: Denis
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: jaslam@xxxxxxxxxxxxxxxx
Re: Questions about Parity SAT
- From: Ryan Williams
Re: Questions about Parity SAT
- From: Radoslaw Hofman
Re: Questions about Parity SAT
- From: Mike Robson
Re: Questions about Parity SAT
- From: Radoslaw Hofman
Re: Category theory for understanding the internet
- From: Michal Przybylek
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Combinatorics Question
- From: Cantab
Combinatorics Question
- From: Cantab
البرنامج الاسطوري الذي ادهش الملايين !! فقط ضع صورتك ويعطيك شكلك بعد 40 سنه
- From: فواز
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Ben Bacarisse
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: jaslam@xxxxxxxxxxxxxxxx
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: jaslam
Category theory for understanding the internet
- From: Ben
A result from my work at the Perimeter Institute
- From: Ben
Class of Total function is PRC Class ?
- From: freebsd . dev
CALL FOR PAPERS: Finite-State Methods and Natural Language Processing 2008
- From: jpiskorski
Asymptotic notation, multiple variables
- From: Rod Howell
Re: Could anyone help me with this math problem please?
- From: SiBBi
Re: Questions about Parity SAT
- From: Finder
Re: Questions about Parity SAT
- From: Radoslaw Hofman
Could anyone help me with this math problem please?
- From: Tonny
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Questions about Parity SAT
- From: Finder
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Ben Bacarisse
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
CFP: 8th International Conference on Hybrid Intelligent Systems (HIS 2008)
- From: Sabri Pllana
Re: How to proof primitive recursive?
- From: Thomas Paetz
Re: Final Call for papers
- From: Never2Crazy
Re: How to proof primitive recursive?
- From: Barb Knox
How to proof primitive recursive?
- From: fairchilddb@xxxxxxxxx
Final Call for papers
- From: john
CFP - The 1st International Workshop on Bit-Precise Reasoning (BPR 2008)
- From: bit.precise.reasoning@xxxxxxxxx
Re: multi-dimensional knapsack problem (MKP) instance generation
- From: Shalin Shah
Re: A New Reduction Rule for Exactly 1 in 3 SAT
- From: malinka
Re: A New Reduction Rule for Exactly 1 in 3 SAT
- From: malinka
multi-dimensional knapsack problem (MKP) instance generation
- From: Ian
HARDISK PROBLEM
- From: hluasjp@xxxxxxxxx
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Radoslaw Hofman
CFP: INTERNATIONAL WORKSHOP ON OPTICAL SUPERCOMPUTING (OSC'08)
- From: optical supercomputing
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Re: Hamiltonian cycle problem in 2-connected bipartite cubic graph is Polynomial
- From: Zhu Guohun
Run-time for SP algorithms on different computers
- From: TheTravellingSalesman