The Quantum Monad on Relational Structures (English)
Free access
- New search for: Abramsky, Samson
- New search for: Barbosa, Rui Soares
- New search for: de Silva, Nadish
- New search for: Zapata, Octavio
- New search for: Abramsky, Samson
- New search for: Barbosa, Rui Soares
- New search for: de Silva, Nadish
- New search for: Zapata, Octavio
- New search for: Larsen, Kim G.
- New search for: Bodlaender, Hans L.
- New search for: Raskin, Jean-Francois
In:
LIPIcs, Volume 83, MFCS 2017
: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
;
83
;
35:1-35:19
;
2017
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:The Quantum Monad on Relational Structures
-
Contributors:Abramsky, Samson ( author ) / Barbosa, Rui Soares ( author ) / de Silva, Nadish ( author ) / Zapata, Octavio ( author ) / Larsen, Kim G. ( editor ) / Bodlaender, Hans L. ( editor ) / Raskin, Jean-Francois ( editor )
-
Published in:LIPIcs, Volume 83, MFCS 2017 : 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) ; 83 ; 35:1-35:19Leibniz International Proceedings in Informatics (LIPIcs) ; 83 ; 35:1-35:19
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2017-12-01
-
Size:19 pages , 602503 byte
-
Remarks:LIPIcs, Vol. 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), pages 35:1-35:19
-
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
-
Does Looking Inside a Circuit Help?Impagliazzo, Russell / Kabanets, Valentine / Kolokolova, Antonina / McKenzie, Pierre / Romani, Shadab et al. | 2017
- 2
-
The Power of Programs over Monoids in DAGrosshans, Nathan / McKenzie, Pierre / Segoufin, Luc et al. | 2017
- 3
-
Regular Language Distance and EntropyParker, Austin J. / Yancey, Kelly B. / Yancey, Matthew P. et al. | 2017
- 4
-
The Complexity of Boolean Surjective General-Valued CSPsFulla, Peter / Zivny, Stanislav et al. | 2017
- 5
-
On the Expressive Power of Quasiperiodic SFTDurand, Bruno / Romashchenko, Andrei et al. | 2017
- 6
-
Parameterized Algorithms for Partitioning Graphs into Highly Connected ClustersBliznets, Ivan / Karpov, Nikolai et al. | 2017
- 7
-
Hypercube LSH for Approximate near NeighborsLaarhoven, Thijs et al. | 2017
- 8
-
Generalized Predecessor Existence Problems for Boolean Finite Dynamical SystemsKawachi, Akinori / Ogihara, Mitsunori / Uchizawa, Kei et al. | 2017
- 9
-
Dividing Splittable Goods Evenly and With Limited FragmentationDamaschke, Peter et al. | 2017
- 10
-
Small-Space LCE Data Structure with Constant-Time QueriesTanimura, Yuka / Nishimoto, Takaaki / Bannai, Hideo / Inenaga, Shunsuke / Takeda, Masayuki et al. | 2017
- 11
-
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum MechanicsJeandel, Emmanuel / Perdrix, Simon / Vilmart, Renaud / Wang, Quanlong et al. | 2017
- 12
-
Counting Problems for Parikh ImagesHaase, Christoph / Kiefer, Stefan / Lohrey, Markus et al. | 2017
- 13
-
Communication Complexity of Pairs of Graph Families with ApplicationsKolay, Sudeshna / Panolan, Fahad / Saurabh, Saket et al. | 2017
- 14
-
Monitor Logics for Quantitative Monitor AutomataPaul, Erik et al. | 2017
- 15
-
The Complexity of Quantum DisjointnessKlauck, Hartmut et al. | 2017
- 16
-
Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case AnalysisDeng, Xiaotie / Gao, Yansong / Zhang, Jie et al. | 2017
- 17
-
Time Complexity of Constraint Satisfaction via Universal AlgebraJonsson, Peter / Lagerkvist, Victor / Roy, Biman et al. | 2017
- 18
-
The Hardness of Solving Simple Word EquationsDay, Joel D. / Manea, Florin / Nowotka, Dirk et al. | 2017
- 19
-
Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical MatricesDaviaud, Laure / Guillon, Pierre / Merlet, Glenn et al. | 2017
- 20
-
Binary Search in Graphs RevisitedDeligkas, Argyrios / Mertzios, George B. / Spirakis, Paul G. et al. | 2017
- 21
-
A Formal Semantics of Influence in Bayesian ReasoningJacobs, Bart / Zanasi, Fabio et al. | 2017
- 22
-
The Complexity of SORE-definability ProblemsLu, Ping / Wu, Zhilin / Chen, Haiming et al. | 2017
- 23
-
TC^0 Circuits for Algorithmic Problems in Nilpotent GroupsMyasnikov, Alexei / Weiß, Armin et al. | 2017
- 24
-
Better Complexity Bounds for Cost Register AutomataAllender, Eric / Krebs, Andreas / McKenzie, Pierre et al. | 2017
- 25
-
Kernelization of the Subset General Position Problem in GeometryBoissonnat, Jean-Daniel / Dutta, Kunal / Ghosh, Arijit / Kolay, Sudeshna et al. | 2017
- 26
-
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching ProgramsGlinskih, Ludmila / Itsykson, Dmitry et al. | 2017
- 27
-
The Complexity of Quantified Constraints Using the Algebraic FormulationCarvalho, Catarina / Martin, Barnaby / Zhuk, Dmitriy et al. | 2017
- 28
-
Induced Embeddings into Hamming GraphsMilanic, Martin / Mursic, Peter / Mydlarz, Marcelo et al. | 2017
- 29
-
Structured Connectivity AugmentationFomin, Fedor V. / Golovach, Petr A. / Thilikos, Dimitrios M. et al. | 2017
- 30
-
Combinatorial Properties and Recognition of Unit Square Visibility GraphsCasel, Katrin / Fernau, Henning / Grigoriev, Alexander / Schmid, Markus L. / Whitesides, Sue et al. | 2017
- 31
-
Weighted Operator Precedence LanguagesDroste, Manfred / Dück, Stefan / Mandrioli, Dino / Pradella, Matteo et al. | 2017
- 32
-
Model Checking and Validity in Propositional and Modal Inclusion LogicsHella, Lauri / Kuusisto, Antti / Meier, Arne / Virtema, Jonni et al. | 2017
- 33
-
Emptiness Problems for Integer CircuitsBarth, Dominik / Beck, Moritz / Dose, Titus / Glaßer, Christian / Michler, Larissa / Technau, Marc et al. | 2017
- 34
-
Another Characterization of the Higher K-TrivialsAnglès d'Auriac, Paul-Elliot / Monin, Benoit et al. | 2017
- 35
-
The Quantum Monad on Relational StructuresAbramsky, Samson / Barbosa, Rui Soares / de Silva, Nadish / Zapata, Octavio et al. | 2017
- 36
-
Towards a Polynomial Kernel for Directed Feedback Vertex SetBergougnoux, Benjamin / Eiben, Eduard / Ganian, Robert / Ordyniak, Sebastian / Ramanujan, M. S. et al. | 2017
- 37
-
Timed Network GamesAvni, Guy / Guha, Shibashis / Kupferman, Orna et al. | 2017
- 38
-
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free RingsArvind, Vikraman / Datta, Rajit / Mukhopadhyay, Partha / Raja, S. et al. | 2017
- 39
-
Faster Algorithms for Mean-Payoff Parity GamesChatterjee, Krishnendu / Henzinger, Monika / Svozil, Alexander et al. | 2017
- 40
-
Attainable Values of Reset ThresholdsDzyga, Michalina / Ferens, Robert / Gusev, Vladimir V. / Szykula, Marek et al. | 2017
- 41
-
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse TreesLagarde, Guillaume / Limaye, Nutan / Srinivasan, Srikanth et al. | 2017
- 42
-
Approximation and Parameterized Algorithms for Geometric Independent Set with ShrinkingPilipczuk, Michal / van Leeuwen, Erik Jan / Wiese, Andreas et al. | 2017
- 43
-
Eilenberg Theorems for FreeUrbat, Henning / Adámek, Jiri / Chen, Liang-Ting / Milius, Stefan et al. | 2017
- 44
-
Membership Problem in GL(2, Z) Extended by Singular MatricesPotapov, Igor / Semukhin, Pavel et al. | 2017
- 45
-
Grammars for Indentation-Sensitive ParsingNestra, Härmel et al. | 2017
- 46
-
The Power of Linear-Time Data Reduction for Maximum MatchingMertzios, George B. / Nichterlein, André / Niedermeier, Rolf et al. | 2017
- 47
-
Two-Planar Graphs Are QuasiplanarHoffmann, Michael / Tóth, Csaba D. et al. | 2017
- 48
-
The Shortest Identities for Max-Plus Automata with Two StatesDaviaud, Laure / Johnson, Marianne et al. | 2017
- 49
-
On the Upward/Downward Closures of Petri NetsAtig, Mohamed Faouzi / Meyer, Roland / Muskalla, Sebastian / Saivasan, Prakash et al. | 2017
- 50
-
On Multidimensional and Monotone k-SUMHsu, Chloe Ching-Yun / Umans, Chris et al. | 2017
- 51
-
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph ParametersHatanaka, Tatsuhiko / Ito, Takehiro / Zhou, Xiao et al. | 2017
- 52
-
Automata in the Category of Glued Vector SpacesColcombet, Thomas / Petrisan, Daniela et al. | 2017
- 53
-
The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are DecidablePaul, Erik et al. | 2017
- 54
-
New Insights on the (Non-)Hardness of Circuit Minimization and Related ProblemsAllender, Eric / Hirahara, Shuichi et al. | 2017
- 55
-
Strategy Complexity of Concurrent Safety GamesChatterjee, Krishnendu / Hansen, Kristoffer Arnsfelt / Ibsen-Jensen, Rasmus et al. | 2017
- 56
-
A Characterisation of Pi^0_2 Regular Tree LanguagesCavallari, Filippo / Michalewski, Henryk / Skrzypczak, Michal et al. | 2017
- 57
-
On the Exact Amount of Missing Information that Makes Finding Possible Winners HardDey, Palash / Misra, Neeldhara et al. | 2017
- 58
-
Fractal Intersections and Products via Algorithmic DimensionLutz, Neil et al. | 2017
- 59
-
Domains for Higher-Order GamesHague, Matthew / Meyer, Roland / Muskalla, Sebastian et al. | 2017
- 60
-
Fine-Grained Complexity of Rainbow Coloring and its VariantsAgrawal, Akanksha et al. | 2017
- 61
-
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected GraphsChatterjee, Krishnendu / Ibsen-Jensen, Rasmus / Nowak, Martin A. et al. | 2017
- 62
-
The 2CNF Boolean Formula Satisfiability Problem and the Linear Space HypothesisYamakami, Tomoyuki et al. | 2017
- 63
-
Variations on Inductive-Recursive DefinitionsGhani, Neil / McBride, Conor / Nordvall Forsberg, Fredrik / Spahn, Stephan et al. | 2017
- 64
-
One-Dimensional Logic over TreesKieronski, Emanuel / Kuusisto, Antti et al. | 2017
- 65
-
An Improved FPT Algorithm for the Flip Distance ProblemLi, Shaohua / Feng, Qilong / Meng, Xiangzhong / Wang, Jianxin et al. | 2017
- 66
-
Reversible Kleene latticesBrunet, Paul et al. | 2017
- 67
-
Lossy Kernels for Hitting SubgraphsEiben, Eduard / Hermelin, Danny / Ramanujan, M. S. et al. | 2017
- 68
-
Undecidable Problems for Probabilistic Network ProgrammingKahn, David M. et al. | 2017
- 69
-
Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive HexagonVikas, Narayan et al. | 2017
- 70
-
Recognizing Graphs Close to Bipartite GraphsBonamy, Marthe / Dabrowski, Konrad K. / Feghali, Carl / Johnson, Matthew / Paulusma, Daniël et al. | 2017
- 71
-
Parameterized Algorithms and Kernels for Rainbow MatchingGupta, Sushmita / Roy, Sanjukta / Saurabh, Saket / Zehavi, Meirav et al. | 2017
- 72
-
Compositional Weak Metrics for Group Key UpdateLanotte, Ruggero / Merro, Massimo / Tini, Simone et al. | 2017
- 73
-
Clique-Width for Graph Classes Closed under ComplementationBlanché, Alexandre / Dabrowski, Konrad K. / Johnson, Matthew / Lozin, Vadim V. / Paulusma, Daniël / Zamaraev, Viktor et al. | 2017
- 74
-
Computing the Maximum using (min, +) FormulasMahajan, Meena / Nimbhorkar, Prajakta / Tawari, Anuj et al. | 2017
- 75
-
Selecting Nodes and Buying Links to Maximize the Information Diffusion in a NetworkD'Angelo, Gianlorenzo / Severini, Lorenzo / Velaj, Yllka et al. | 2017
- 76
-
K4-free Graphs as a Free AlgebraCosme Llópez, Enric / Pous, Damien et al. | 2017
- 77
-
Making Metric Temporal Logic RationalKrishna, Shankara Narayanan / Madnani, Khushraj / Pandya, Paritosh K. et al. | 2017
- 78
-
Complexity of Restricted Variants of Skolem and Related ProblemsS., Akshay / Balaji, Nikhil / Vyas, Nikhil et al. | 2017
- 79
-
Being Even Slightly Shallow Makes Life HardMuzi, Irene / O'Brien, Michael P. / Reidl, Felix / Sullivan, Blair D. et al. | 2017
- 80
-
Walrasian Pricing in Multi-Unit AuctionsBrânzei, Simina / Filos-Ratsikas, Aris / Miltersen, Peter Bro / Zeng, Yulong et al. | 2017
- 81
-
Distributed Strategies Made EasyCastellan, Simon / Clairambault, Pierre / Winskel, Glynn et al. | 2017
- 82
-
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)Pilipczuk, Michal et al. | 2017
- 83
-
Hardness and Approximation of High-Dimensional Search Problems (Invited Talk)Pagh, Rasmus et al. | 2017
- 84
-
Temporal Logics for Multi-Agent Systems (Invited Talk)Markey, Nicolas et al. | 2017
- 85
-
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)Schnoebelen, Philippe et al. | 2017