Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants-Reference-Cited by-同舟云学术

Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants

Published:2012 Issue: Volume: Page:435-447
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Duchier Denys,Durand-Lose Jérôme,Senot Maxime

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-29952-0_42.pdf

Reference21 articles.

1. Aaronson, S.: NP-complete problems and physical reality. SIGACT News 36(1), 30–52 (2005)

2. Lecture Notes in Computer Science;E. Asarin,1995

3. Cook, M.: Universality in elementary cellular automata. Compl. Syst. 15(1), 1–40 (2004)

4. Cook, S.: The complexity of theorem proving procedures. In: 3rd Symp. on Theory of Computing (STOC 1971), pp. 151–158. ACM (1971)

5. Dean, J., Ghemawat, S.: Map/Reduce: simplified data processing on large clusters. In: 6th Symp. on Operating Systems Design & Implementation (OSDI 2004). USENIX Association (2004)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines;Theoretical Computer Science;2021-11

2. Abstract geometrical computation 8: Small machines, accumulations & rationality;Journal of Computer and System Sciences;2018-11

3. Ways to Compute in Euclidean Frameworks;Unconventional Computation and Natural Computation;2017

4. Computing in Perfect Euclidean Frameworks;Emergence, Complexity and Computation;2016-07-19

5. Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds;Lecture Notes in Computer Science;2013