Sciweavers

Share
CSR
2008
Springer
10 years 1 months ago
The Most General Conservation Law for a Cellular Automaton
Abstract. We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and ...
Enrico Formenti, Jarkko Kari, Siamak Taati
CSR
2008
Springer
10 years 1 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
CSR
2008
Springer
10 years 1 months ago
A Logspace Algorithm for Partial 2-Tree Canonization
Abstract. We show that partial 2-tree canonization, and hence isomorphism testing for partial 2-trees, is in deterministic logspace. Our algorithm involves two steps: (a) We exploi...
Vikraman Arvind, Bireswar Das, Johannes Köble...
CSR
2008
Springer
10 years 1 months ago
From Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
Johannes Köbler, Oleg Verbitsky
books