Back to Results
First PageMeta Content
Constraint programming / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean satisfiability problem / Symbol / Tree automaton / Satisfiability / Theoretical computer science / Applied mathematics / Mathematics


Efficient Reasoning about Data Trees via Integer Linear Programming Claire David Leonid Libkin
Add to Reading List

Document Date: 2010-12-15 16:00:04

Open Document

File Size: 206,74 KB

Share Result on Facebook

City

Uppsala / /

Country

Sweden / /

Currency

USD / /

/

Event

Product Recall / Product Issues / /

Facility

Integer Linear Programming Claire David Leonid Libkin Tony Tan Université Paris-Est University of Edinburgh University / /

IndustryTerm

non-negative solution / integer solution / quadratic time algorithm / /

Movie

We shall see / /

OperatingSystem

XP / /

Organization

V (ai ) / University of Edinburgh University / /

Person

Claire David Leonid Libkin Tony Tan Université / /

Position

Data Models General / /

Product

REPRESENTATIONS THE SATISFIABILITY PROBLEM OF / /

ProgrammingLanguage

XML / /

Technology

DTD / XML / Dom / document type definition / NP algorithm / quadratic time algorithm / /

SocialTag