Loading...
Please wait, while we are loading the content...
Similar Documents
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-complete
| Content Provider | Semantic Scholar |
|---|---|
| Author | Kuncak, Viktor |
| Copyright Year | 2007 |
| Abstract | Note: MIT-CSAIL-TR-2007-001 Reference LARA-REPORT-2007-001 URL: http://hdl.handle.net/1721.1/35258 Record created on 2007-08-21, modified on 2017-05-12 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://lara.epfl.ch/~kuncak/papers/Kuncak07QuantifierFreeBAPAinNP.pdf |
| Alternate Webpage(s) | http://dspace.mit.edu/bitstream/1721.1/35258/1/MIT-CSAIL-TR-2007-001.pdf |
| Alternate Webpage(s) | http://dspace.mit.edu/bitstream/handle/1721.1/35258/MIT-CSAIL-TR-2007-001.pdf?sequence=1 |
| Alternate Webpage(s) | http://lara.epfl.ch/~kuncak/papers/Kuncak07QuantifierFreeBAPAinNP.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |