Search results for "DEXPTIME-complete"

Found 20 publication records. Showing 20 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
95	Harry G. Mairson	Deciding ML Typability is Complete for Deterministic Exponential Time.	POPL	1990	DBLP DOI BibTeX RDF	ML
80	Helmut Seidl, Kumar Neeraj Verma	Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	instantiation-based theorem proving, Cryptographic protocols, first-order logic, resolution, Horn clauses
80	Helmut Seidl, Kumar Neeraj Verma	Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.	LPAR	2004	DBLP DOI BibTeX RDF
68	Witold Charatonik, Andreas Podelski	Set Constraints with Intersection.	LICS	1997	DBLP DOI BibTeX RDF	satisfiability test, set-based program analysis, DEXPTIME-complete, complexity characterization, negative set constraints, negated conjuncts, negated inclusion, computability, decidability, intersection, inclusions, set constraints
48	Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh	A dexptime-Complete Dolev-Yao Theory with Distributive Encryption.	MFCS	2010	DBLP DOI BibTeX RDF
48	Helmut Seidl	Haskell Overloading is DEXPTIME-Complete.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
48	Jean Goubault	Rigid E-Unifiability is DEXPTIME-Complete	LICS	1994	DBLP DOI BibTeX RDF
39	Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch	Unification Modulo ACUI Plus Distributivity Axioms.	J. Autom. Reason.	2004	DBLP DOI BibTeX RDF	equational unification, counter machines, complexity, decidability, rewriting, set constraints, Post correspondence problem
25	Witold Charatonik, Andreas Podelski	Directional Type Inference for Logic Programs.	SAS	1998	DBLP DOI BibTeX RDF
23	Witold Charatonik, Jean-Marc Talbot	Atomic Set Constraints with Projection.	RTA	2002	DBLP DOI BibTeX RDF
23	Jean-Marc Talbot	On the Alternation-Free Horn Mu-calculus.	LPAR	2000	DBLP DOI BibTeX RDF
23	Frank Drewes	Exponential Output Size of Top-Down Tree Transducers.	FCT	1999	DBLP DOI BibTeX RDF
23	Helmut Seidl	Deciding Equivalence of Finite Tree Automata.	STACS	1989	DBLP DOI BibTeX RDF
21	Helmut Seidl, Kumar Neeraj Verma	Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.	RTA	2009	DBLP DOI BibTeX RDF
21	Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron	Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.	CSL	2003	DBLP DOI BibTeX RDF
21	Witold Charatonik, Andreas Podelski, Jean-Marc Talbot	Paths vs. Trees in Set-Based Program Analysis.	POPL	2000	DBLP DOI BibTeX RDF
21	Witold Charatonik	Directional Type Checking for Logic Programs: Beyond Discriminative Types.	ESOP	2000	DBLP DOI BibTeX RDF	types in logic programming, directional types, tree automata, regular types
21	Witold Charatonik, Andreas Podelski	Co-definite Set Constraints.	RTA	1998	DBLP DOI BibTeX RDF
21	Igor Walukiewicz	Pushdown Processes: Games and Model Checking.	CAV	1996	DBLP DOI BibTeX RDF
21	Konstantin Skodinis, Egon Wanke	Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.	WG	1994	DBLP DOI BibTeX RDF