Parameterized Complexity of Small Weight Automorphisms (English)
Free access
- New search for: Arvind, Vikraman
- New search for: Köbler, Johannes
- New search for: Kuhnert, Sebastian
- New search for: Torán, Jacobo
- New search for: Arvind, Vikraman
- New search for: Köbler, Johannes
- New search for: Kuhnert, Sebastian
- New search for: Torán, Jacobo
- New search for: Vollmer, Heribert
- New search for: Vallée, Brigitte
In:
LIPIcs, Volume 66, STACS 2017
: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
;
66
;
7:1-7:13
;
2017
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:Parameterized Complexity of Small Weight Automorphisms
-
Contributors:Arvind, Vikraman ( author ) / Köbler, Johannes ( author ) / Kuhnert, Sebastian ( author ) / Torán, Jacobo ( author ) / Vollmer, Heribert ( editor ) / Vallée, Brigitte ( editor )
-
Published in:LIPIcs, Volume 66, STACS 2017 : 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) ; 66 ; 7:1-7:13Leibniz International Proceedings in Informatics (LIPIcs) ; 66 ; 7:1-7:13
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2017-03-06
-
Size:13 pages , 574475 byte
-
Remarks:LIPIcs, Vol. 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), pages 7:1-7:13
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Computational Aspects of Logics in Team Semantics (Tutorial)Kontinen, Juha et al. | 2017
- 2
-
Recompression: New Approach to Word Equations and Context Unification (Invited Talk)Jez, Artur et al. | 2017
- 3
-
Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)Joux, Antoine et al. | 2017
- 4
-
Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk)Tantau, Till et al. | 2017
- 5
-
Split Contraction: The Untold StoryAgrawal, Akanksha / Lokshtanov, Daniel / Saurabh, Saket / Zehavi, Meirav et al. | 2017
- 6
-
The Operator Approach to Entropy GamesAkian, Marianne / Gaubert, Stéphane / Grand-Clément, Julien / Guillaud, Jérémie et al. | 2017
- 7
-
Parameterized Complexity of Small Weight AutomorphismsArvind, Vikraman / Köbler, Johannes / Kuhnert, Sebastian / Torán, Jacobo et al. | 2017
- 8
-
What Can Be Verified Locally?Balliu, Alkida / D'Angelo, Gianlorenzo / Fraigniaud, Pierre / Olivetti, Dennis et al. | 2017
- 9
-
Improved Time-Space Trade-Offs for Computing Voronoi DiagramsBanyassady, Bahareh / Korman, Matias / Mulzer, Wolfgang / van Renssen, André / Roeloffzen, Marcel / Seiferth, Paul / Stein, Yannik et al. | 2017
- 10
-
Energy-Efficient Delivery by Heterogeneous Mobile AgentsBärtschi, Andreas / Chalopin, Jérémie / Das, Shantanu / Disser, Yann / Graf, Daniel / Hackfeld, Jan / Penna, Paolo et al. | 2017
- 11
-
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph StreamsBera, Suman K. / Chakrabarti, Amit et al. | 2017
- 12
-
On Polynomial Approximations Over Z/2^kZ*Bhrushundi, Abhishek / Harsha, Prahladh / Srinivasan, Srikanth et al. | 2017
- 13
-
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player GamesBilò, Vittorio / Mavronicolas, Marios et al. | 2017
- 14
-
On Büchi One-Counter AutomataBöhm, Stanislav / Göller, Stefan / Halfon, Simon / Hofman, Piotr et al. | 2017
- 15
-
Optimizing Tree Decompositions in MSOBojanczyk, Mikolaj / Pilipczuk, Michal et al. | 2017
- 16
-
Complexity of Token Swapping and its VariantsBonnet, Édouard / Miltzow, Tillmann / Rzazewski, Pawel et al. | 2017
- 17
-
Monte Carlo ComputabilityBrattka, Vasco / Hölzl, Rupert / Kuyper, Rutger et al. | 2017
- 18
-
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial ComplexBurton, Benjamin / Cabello, Sergio / Kratsch, Stefan / Pettersson, William et al. | 2017
- 19
-
On Long Words Avoiding Zimin PatternsCarayol, Arnaud / Göller, Stefan et al. | 2017
- 20
-
Extended Learning Graphs for Triangle FindingCarette, Titouan / Laurière, Mathieu / Magniez, Frédéric et al. | 2017
- 21
-
Lower Bounds for Elimination via Weak RegularityChattopadhyay, Arkadev / Dvorák, Pavel / Koucký, Michal / Loff, Bruno / Mukhopadhyay, Sagnik et al. | 2017
- 22
-
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time MatrixChen, Lin / Marx, Dániel / Ye, Deshi / Zhang, Guochuan et al. | 2017
- 23
-
Fractional Coverings, Greedy Coverings, and Rectifier NetworksChistikov, Dmitry / Iván, Szabolcs / Lubiw, Anna / Shallit, Jeffrey et al. | 2017
- 24
-
Separability of Reachability Sets of Vector Addition SystemsClemente, Lorenzo / Czerwinski, Wojciech / Lasota, Slawomir / Paperman, Charles et al. | 2017
- 25
-
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph ClassesCurticapean, Radu / Dell, Holger / Roth, Marc et al. | 2017
- 26
-
Robust and Adaptive SearchDisser, Yann / Kratsch, Stefan et al. | 2017
- 27
-
Graphic TSP in Cubic GraphsDvorák, Zdenek / Král, Daniel / Mohar, Bojan et al. | 2017
- 28
-
Independent Sets near the Lower Bound in Bounded Degree GraphsDvorák, Zdenek / Lidický, Bernard et al. | 2017
- 29
-
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit ProblemFijalkow, Nathanaël / Ohlmann, Pierre / Ouaknine, Joël / Pouly, Amaury / Worrell, James et al. | 2017
- 30
-
The First-Order Logic of HyperpropertiesFinkbeiner, Bernd / Zimmermann, Martin et al. | 2017
- 31
-
Improving and Extending the Testing of Distributions for Shape-Restricted PropertiesFischer, Eldar / Lachish, Oded / Vasudev, Yadu et al. | 2017
- 32
-
Matrix Rigidity from the Viewpoint of Parameterized ComplexityFomin, Fedor V. / Lokshtanov, Daniel / Meesum, S. M. / Saurabh, Saket / Zehavi, Meirav et al. | 2017
- 33
-
Deterministic Regular Expressions with Back-ReferencesFreydenberger, Dominik D. / Schmid, Markus L. et al. | 2017
- 34
-
On the Decomposition of Finite-Valued Streaming String TransducersGallot, Paul / Muscholl, Anca / Puppis, Gabriele / Salvati, Sylvain et al. | 2017
- 35
-
Circuit Evaluation for Finite SemiringsGanardi, Moses / Hucke, Danny / König, Daniel / Lohrey, Markus et al. | 2017
- 36
-
Combining Treewidth and Backdoors for CSPGanian, Robert / Ramanujan, M. S. / Szeider, Stefan et al. | 2017
- 37
-
On the Complexity of Partial DerivativesGarcia-Marco, Ignacio / Koiran, Pascal / Pecatte, Timothée / Thomassé, Stéphan et al. | 2017
- 38
-
Set Membership with Non-Adaptive Bit ProbesGarg, Mohit / Radhakrishnan, Jaikumar et al. | 2017
- 39
-
Pro-Aperiodic Monoids via Saturated Modelsvan Gool, Samuel J. / Steinberg, Benjamin et al. | 2017
- 40
-
Trimming and Gluing Gray CodesGregor, Petr / Mütze, Torsten et al. | 2017
- 41
-
Mixing of Permutations by Biased TranspositionHaddadan, Shahrzad / Winkler, Peter et al. | 2017
- 42
-
Efficient Quantum Walk on the Grid with Multiple Marked ElementsHoyer, Peter / Komeili, Mojtaba et al. | 2017
- 43
-
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of VariablesItsykson, Dmitry / Knop, Alexander / Romashchenko, Andrey / Sokolov, Dmitry et al. | 2017
- 44
-
Multiple Random Walks on Paths and GridsIvaskovic, Andrej / Kosowski, Adrian / Pajak, Dominik / Sauerwald, Thomas et al. | 2017
- 45
-
On the Size of Lempel-Ziv and Lyndon FactorizationsKärkkäinen, Juha / Kempa, Dominik / Nakashima, Yuto / Puglisi, Simon J. / Shur, Arseny M. et al. | 2017
- 46
-
Voting and Bribing in Single-Exponential TimeKnop, Dusan / Koutecký, Martin / Mnich, Matthias et al. | 2017
- 47
-
A Complexity Dichotomy for Poset Constraint SatisfactionKompatscher, Michael / Pham, Trung Van et al. | 2017
- 48
-
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed GraphsKreutzer, Stephan / Rabinovich, Roman / Siebertz, Sebastian / Weberstädt, Grischa et al. | 2017
- 49
-
Computing Majority by Constant Depth Majority Circuits with Low Fan-in GatesKulikov, Alexander S. / Podolskii, Vladimir V. et al. | 2017
- 50
-
Minkowski GamesLe Roux, Stéphane / Pauly, Arno / Raskin, Jean-François et al. | 2017
- 51
-
On the Sensitivity Complexity of k-Uniform Hypergraph PropertiesLi, Qian / Sun, Xiaoming et al. | 2017
- 52
-
The Complexity of Knapsack in Graph GroupsLohrey, Markus / Zetzsche, Georg et al. | 2017
- 53
-
Algorithmic Information, Plane Kakeya Sets, and Conditional DimensionLutz, Jack H. / Lutz, Neil et al. | 2017
- 54
-
On the Synchronisation Problem over Cellular AutomataRichard, Gaétan et al. | 2017
- 55
-
Word Equations Where a Power Equals a Product of PowersSaarela, Aleksi et al. | 2017
- 56
-
Improved Distance Queries and Cycle Counting by Frobenius Normal FormSankowski, Piotr / Wegrzycki, Karol et al. | 2017
- 57
-
Lower Bounds on Key Derivation for Square-Friendly ApplicationsSkorski, Maciej et al. | 2017
- 58
-
List Approximation for Increasing Kolmogorov ComplexityZimand, Marius et al. | 2017