Back to Results
First PageMeta Content
Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Complexity classes / Satisfiability Modulo Theories / Symbol / Boolean satisfiability problem / P-complete / Theoretical computer science / Computational complexity theory / Applied mathematics


1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh
Add to Reading List

Document Date: 2012-04-27 14:06:25

Open Document

File Size: 355,95 KB

Share Result on Facebook

City

Paris / New York / /

Company

ACM Inc. / /

Country

United States / /

Currency

USD / /

/

Facility

Penn Plaza / University of Edinburgh TONY TAN / University of Edinburgh / /

/

IndustryTerm

integer solution / /

Movie

We shall see / /

Organization

University of Edinburgh Data / V (ai ) / University of Edinburgh / /

Person

LEONID LIBKIN / CLAIRE DAVID / TONY TAN / Thatcher / /

/

Position

first author / Data Models General / /

Product

Z3 / /

ProgrammingLanguage

C / XPath / XML / /

ProvinceOrState

New York / /

Technology

DTD / XML / Dom / NP algorithm / /

URL

http /

SocialTag