Остановите войну!
for scientists:
default search action
Alasdair Urquhart
- > Home > Persons > Alasdair Urquhart
Publications
- 2009
- [j36]Alexander Hertel, Alasdair Urquhart:
Algorithms and Complexity Results for Input and Unit Resolution. J. Satisf. Boolean Model. Comput. 6(1-3): 141-164 (2009) - [i3]Alexander Hertel, Alasdair Urquhart:
Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [j31]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution. Theory Comput. 3(1): 81-102 (2007) - [c12]Alexander Hertel, Alasdair Urquhart:
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. CSL 2007: 527-541 - [c11]Alexander Hertel, Philipp Hertel, Alasdair Urquhart:
Formalizing Dangerous SAT Encodings. SAT 2007: 159-172 - 2006
- [j30]Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart:
The complexity of analytic tableaux. J. Symb. Log. 71(3): 777-790 (2006) - [i2]Alexander Hertel, Alasdair Urquhart:
The Resolution Width Problem is EXPTIME-Complete. Electron. Colloquium Comput. Complex. TR06 (2006) - 2004
- [j28]Michael Soltys, Alasdair Urquhart:
Matrix identities and the pigeonhole principle. Arch. Math. Log. 43(3): 351-358 (2004) - 2002
- [c7]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An exponential separation between regular and general resolution. STOC 2002: 448-456 - 2001
- [c6]Noriko H. Arai, Toniann Pitassi, Alasdair Urquhart:
The complexity of analytic tableaux. STOC 2001: 356-363 - [i1]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c5]Noriko H. Arai, Alasdair Urquhart:
Local Symmetries in Propositional Logic. TABLEAUX 2000: 40-51 - 1995
- [j16]Toniann Pitassi, Alasdair Urquhart:
The Complexity of the Hajos Calculus. SIAM J. Discret. Math. 8(3): 464-483 (1995) - 1994
- [c4]Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart:
Upper and Lower Bounds for Tree-Like Cutting Planes Proofs. LICS 1994: 220-228 - 1993
- [j15]Stephen A. Cook, Alasdair Urquhart:
Functional Interpretations of Feasibly Constructive Arithmetic. Ann. Pure Appl. Log. 63(2): 103-200 (1993) - 1992
- [j12]Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart:
Approximation and Small-Depth Frege Proofs. SIAM J. Comput. 21(6): 1161-1179 (1992) - [c3]Toniann Pitassi, Alasdair Urquhart:
The Complexity of the Hajós Calculus. FOCS 1992: 187-196 - 1991
- [c2]Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart:
Approximation and Small Depth Frege Proofs. SCT 1991: 367-390 - 1989
- [c1]Stephen A. Cook, Alasdair Urquhart:
Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract). STOC 1989: 107-112
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint