SELF-SIMILARITY OF SATISFIABLE BOOLEAN EXPRESSIONS DECIPHERED IN TERMS OF GRAPH DIRECTED ITERATED FUNCTION SYSTEMS

DOI10.1142/S0218348X0800406XzbMath1155.68079MaRDI QIDQ3598884

Zhi-Ying Wen, Tian-jia Ni

Publication date: 3 February 2009

Published in: Fractals (Search for Journal in Brave)

zbMATH Keywords

Hausdorff dimensiondirected graph\(k\)-satisfiability problemcounting dimension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

GAP SEQUENCES OF GRAPH-DIRECTED SETS ⋮ FRACTAL STRUCTURE ON k-SAT

Cites Work

• Valuations of languages, with applications to fractal geometry
• Fixed set theory for closed correspondences with applications to self-similarity and games.
• Tree-based picture generation
• Iterated function systems and control languages
• Dynamical systems, measures, and fractals via domain theory
• Matrix Analysis
• The Tarski–Kantorovitch prinicple and the theory of iterated function systems
• METRIC AND TOPOLOGICAL MULTIVALUED FRACTALS
• Tree-based generation of languages of fractals

This page was built for publication: SELF-SIMILARITY OF SATISFIABLE BOOLEAN EXPRESSIONS DECIPHERED IN TERMS OF GRAPH DIRECTED ITERATED FUNCTION SYSTEMS