"A Superpolynomial Lower Bound for a Circuit Computing the Clique Function ..."

Kazuyuki Amano, Akira Maruoka (1998)

> Home

Details and statistics

DOI: 10.1007/BFB0055789

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/AmanoM98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/AmanoM98
Kazuyuki Amano, Akira Maruoka:
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates. MFCS 1998: 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.