Citations: On the VC-dimension and boolean functions with long runs

Views

CrossRef citations to date

Altmetric

Citations (2)

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

S. Muthammai & S. Dhanalakshmi. (2019) Edge domination in Boolean function graph B(L(G), NINC) of a graph. Journal of Discrete Mathematical Sciences and Cryptography 22:5, pages 847-855.
Read now

Articles from other publishers (1)

Joel Ratsaby. (2008) On the complexity of constrained VC-classes. Discrete Applied Mathematics 156:6, pages 903-910.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

On the VC-dimension and boolean functions with long runs

Articles from other publishers (1)

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

On the VC-dimension and boolean functions with long runs

Citations (2)

Read on this site (1)

Articles from other publishers (1)

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date