Madelaine - PDFSEARCH.IO - Document Search Engine

Madelaine
Results: 58

#	Item
11	The complexity of positive first-order logic without equality FLORENT MADELAINE Clermont Universit, Universit d’Auvergne, LIMOS. CNRS, UMR 6158, LIMOS. and Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-01-14 21:47:14 Finite model theory FO IP Symbol Base Mathematics Creativity
12	Evaluation of Filesystem Provenance Visualization Tools Michelle A. Borkin, Student Member, IEEE, Chelsea S. Yeh, Madelaine Boyd, Peter Macko, Krzysztof Z. Gajos, Margo Seltzer, Member, IEEE, and Hanspeter Pfister, Senio Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2013-10-16 20:19:42 Software Humanities Computing Knowledge representation Workflow technology Data Data visualization Information technology governance Visualization VisTrails Provenance Tree
13	A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-04-03 11:35:00 Mathematics Theoretical computer science Abstract algebra FO Finite model theory Sheaf Boolean satisfiability problem Uniform space
14	Hierarchies in Fragments of Monadic Strict NP Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Abstract. We expose a strict hierar Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:42 Graph theory Mathematics Graph coloring Homomorphism Morphisms XTR Order
15	Quantified Constraints on Directed Graphs Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Abstract We study the quantified H-colou Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:50 Graph theory Mathematics Discrete mathematics NP-complete problems Morphisms Graph coloring Graph homomorphism Degree Line graph
16	The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:55:46 Complexity classes Structural complexity theory FO Finite model theory Computational complexity theory IP Homomorphism NP Reduction Symbol P versus NP problem Model theory
17	CONSTRAINT SATISFACTION WITH COUNTING QUANTIFIERS BARNABY MARTIN ∗† , FLORENT MADELAINE Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2015-03-30 10:49:56 Complexity classes IP FO PSPACE-complete PSPACE Interpretation NP Quantifier Well-formed formula Generalized geography Linear temporal logic
18	The complexity of positive first-order logic without equality Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. Barnaby Martin ´Equipe d Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2011-07-07 14:48:41 Functional analysis Lemmas Symbol FO IP Dual space Craig interpolation Model theory Linear temporal logic
19	Towards a Trichotomy for Quantified H-Coloring Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, DH1 3LE, U.K. Abstract. Hell and Neˇsetˇril proved that Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:57:00 Graph theory Graph coloring NP-complete problems Graph operations Graph homomorphism Morphisms Bipartite graph Graph Core Cycle Matching Bipartite double cover
20	Evaluation of Filesystem Provenance Visualization Tools Michelle A. Borkin, Student Member, IEEE, Chelsea S. Yeh, Madelaine Boyd, Peter Macko, Krzysztof Z. Gajos, Margo Seltzer, Member, IEEE, and Hanspeter Pfister, Senio Add to Reading List Source URL: iis.seas.harvard.edu Language: English - Date: 2013-10-16 20:06:15