The descriptive complexity of subgraph isomorphism without numerics (Q5919541): Difference between revisions

@@ description / en / description / en @@
-scientific article; zbMATH DE number 7076772
+scientific article; zbMATH DE number 6763515
@@ Property / zbMATH Open document ID @@
+.68113
@@ Property / zbMATH Open document ID: 1435.68113 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-58747-9_27
@@ Property / DOI: 10.1007/978-3-319-58747-9_27 / rank @@
+Normal rank
@@ Property / published in @@
+Computer Science – Theory and Applications
@@ Property / published in: Computer Science – Theory and Applications / rank @@
+Normal rank
@@ Property / publication date @@
+August 2017Timestamp +2017-08-22T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-08-22T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 22 August 2017 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6763515
@@ Property / zbMATH DE Number: 6763515 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2801851744
@@ Property / OpenAlex ID: W2801851744 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2587194728
@@ Property / OpenAlex ID: W2587194728 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08067
@@ Property / arXiv ID: 1607.08067 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-subgraph isomorphism on \(\text{AC}^{0}\) circuits
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Polynomial bounds for the grid-minor theorem
@@ Property / cites work: Polynomial bounds for the grid-minor theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4507228
@@ Property / cites work: Q4507228 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subgraph isomorphism: are some patterns substantially easier than others?
+Normal rank
@@ Property / cites work @@
+Is Polynomial Time Choiceless?
@@ Property / cites work: Is Polynomial Time Choiceless? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+On the $AC^0$ Complexity of Subgraph Isomorphism
@@ Property / cites work: On the $AC^0$ Complexity of Subgraph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct definitions in the first order theory of graphs
+Normal rank
@@ Property / cites work @@
+Q5302097
@@ Property / cites work: Q5302097 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4638077
@@ Property / cites work: Q4638077 / rank @@
+Normal rank
@@ Property / cites work @@
+A Short Tutorial on Order-Invariant First-Order Logic
+Normal rank
@@ Property / cites work @@
+The descriptive complexity of subgraph isomorphism without numerics
+Normal rank
@@ Property / cites work @@
+Zero-one \(k\)-law
@@ Property / cites work: Zero-one \(k\)-law / rank @@
+Normal rank
@@ Property / cites work @@
+Q2798999
@@ Property / cites work: Q2798999 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2743189
@@ Property / cites work: Q2743189 / rank @@
+Normal rank
@@ Property / cites work @@
+Girth and treewidth
@@ Property / cites work: Girth and treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+A restricted second order logic for finite structures
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+Some recent progress and applications in graph minor theory
+Normal rank
@@ Property / cites work @@
+Paw-free graphs
@@ Property / cites work: Paw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Logical complexity of graphs: a survey
@@ Property / cites work: Logical complexity of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the definability of properties of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3121527
@@ Property / cites work: Q3121527 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism
+Normal rank
@@ Property / cites work @@
+Q4263664
@@ Property / cites work: Q4263664 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5919541