Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Michael E. Saks

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Toniann Pitassi

> Home > Persons > Michael E. Saks

Publications

2008
[j65]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/AllenderHMPS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/AllenderHMPS08
Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks:
Minimizing Disjunctive Normal Form Formulas and AC⁰ Circuits Given a Truth Table. SIAM J. Comput. 38(1): 63-84 (2008)
2006
[c54]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/AllenderHMPS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/AllenderHMPS06
Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks:
Minimizing DNF Formulas and AC⁰_d Circuits Given a Truth Table. CCC 2006: 237-251
2005
[i6]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR05-126
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR05-126
Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks:
Minimizing DNF Formulas and AC0 Circuits Given a Truth Table. Electron. Colloquium Comput. Complex. TR05 (2005)
2002
[j51]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BeameKPS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BeameKPS02
Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks:
The Efficiency of Resolution and Davis--Putnam Procedures. SIAM J. Comput. 31(4): 1048-1075 (2002)
1998
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/BeameKPS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BeameKPS98
Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks:
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. STOC 1998: 561-571

a service of

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.