Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Hardness of approximate two-level logic minimization and PAC learning with ..."

Vitaly Feldman (2006)

> Home

Details and statistics

DOI: 10.1145/1132516.1132569

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Feldman06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Feldman06
Vitaly Feldman:
Hardness of approximate two-level logic minimization and PAC learning with membership queries. STOC 2006: 363-372

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.