4.5n - o(n) for boolena circuits.">4.5n - o(n) for boolena circuits., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Explicit lower bound of 4.5n - o(n) for boolena circuits."

Oded Lachish, Ran Raz (2001)

> Home

Details and statistics

DOI: 10.1145/380752.380832

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/LachishR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/LachishR01
Oded Lachish, Ran Raz:
Explicit lower bound of 4.5n - o(n) for boolena circuits. STOC 2001: 399-408

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.