comp.theory
By Subject
487 messages sorted by: [ author ] [ date ] [ thread ]
Starting: 03/31/04
Ending: 04/30/04
- "splitting" a propositional sentence
- (fixed) P vs NP: my proof of P != NP
- (graph theory: path problem)how to tell how many path are there from s to t in a graph?
- 12TET Musical 3-Interval-String/6-Interval Cell/Set Non-Redundancy Permutation Ordering Problem:
- 2nd CFP Workshop on Combinatorial and Algorithmic Aspects of Networking
- 3-Hitting Set
- A CFG for a CFL
- A TURING MACHINE that counts in binary
- ACM-SIAM Symposium on Discrete Algorithms - CFP Deadline
- Advice for undergraduate schools?
- AICCSA CFP
- all paths between 2 nodes
- An extension to OOP
- Are there any non-gifted scientists?!?!?
- Bin Laden Captured - photos and video
- Call for an Impeachment Inquiry of Bush and Cheney
- Call for participation: 25 Years of Communicating Sequential Processes, 7-8 July 2004, London, UK
- CFP: 8th Intnl. Conf. on Relational Methods in Computer Science
- CFP: LICS 2004: Call for Short Presentations
- Changing minimization to maximization, do the following problems change?
- Clarifying nondeterminism
- Cognitive Architecture
- Complexity of refuting Turing machine impostors
- Composite hash table/linked list
- Creating an infinite loop on an undirected graph.
- cycle detection in undirected graph
- Data Structure course
- Ehrenfeuct game for First-order logic without equality
- Exponential but not in NP
- formal languages problem
- Formal Semantics of the Java "new" Operator
- functions that halt
- future of programming languages
- Generalized Topological Sorting
- GOLD Parser News: Version 2.2 was released!
- Good Reference for Digraphs
- Graph Algorithm Question
- Graph as Isomorphism Class -- what operation?
- Graph challenge
- Graph query: similar to connectivity
- Graph Theory problem
- Hiding Exact Solutions in Random Graphs
- History of nondeterminism
- How difficult is the firing squad synchronization problem?
- How is this collection called?
- How to Reducing to Conjuntive Normal Form
- how to simulate a Turing Machine on a Post Machine ??
- Indeger division with negative reminders?
- International Journal of Foundations of Computer Science - Vol 15 No 2
- Is it possible to choose a better way?
- Is this SET of computable numbers computable?
- Issues on clockless UART
- IWPEC CFP
- LISPPA (List Processing based on the Polymorphic Arrays)
- Machine Learning for Signal Processing 2004 in Brazil: CFP
- Minimum Bisection
- My Experience as a "Non Gifted" Child
- name for a small variation of the quicksort
- New website: Computability Logic
- non-turing-complete languages
- Optimal data structure
- P != PSPACE ? and quantum computing
- P = NP and if the following idea makes sense
- P = NP Proof Soon To Be Published
- P vs NP and a finite number of sybmols?
- P vs NP: my proof of P != NP
- P vs NP: my proof of P != NP.
- partial functions without a total extension
- petri net languages
- Pokeing a snake up my vagina 9973
- Post doc position available
- Proof of an integer programming problem
- PROOF that emulators are impossible
- Pumping Lemma Palindrome
- Quantum Prime Factorization Algorithm
- Reading Gamma Codes in Reverse?
- REMINDER -- AWOCA submission deadline is April-30-2004
- Reminder: SIGACT News Deadline May 1
- Service Management, ITIL, ITSM new group
- Software for causal and acausal rule discovery
- Sort algorithm for probablistic comparison function
- Sorting algorithm problem
- Systems of total functions (was: functions that halt)
- The T-shaped Universe
- transform knapsack problem -> programming code
- Truth table approach
- Visiting Assistant Professor position at Purdue University
- Wall Street Journal article on TSP
- Webservers
- Who Invented Heaps?
- Work around of using 1D-LUT instead of 2D-LUT
- WP Calculus
Last message date: 04/30/04
Archived on: 04/30/04 CEST
487 messages sorted by: [ author ] [ date ] [ thread ]
