Solving 3CNF-SAT and HPP in linear time using WWW
From MaRDI portal
Recommendations
Cited in
(6)- Networks of picture processors as problem solvers
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
- scientific article; zbMATH DE number 5613969 (Why is no real title available?)
- On the recognition of context-free languages using accepting hybrid networks of evolutionary processors
- Accepting networks of splicing processors: complexity results
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
This page was built for publication: Solving 3CNF-SAT and HPP in linear time using WWW
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710886)